./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3866fcabc53f8729ce5445d739af818fee4df02a7fd7be02b76364ea8cb9d346 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:06:48,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:06:48,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:06:48,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:06:48,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:06:48,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:06:48,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:06:48,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:06:48,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:06:48,460 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:06:48,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:06:48,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:06:48,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:06:48,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:06:48,461 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:06:48,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:06:48,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:06:48,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:06:48,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:06:48,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:06:48,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:06:48,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:06:48,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:06:48,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:06:48,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:06:48,464 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:06:48,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:06:48,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:06:48,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:06:48,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:06:48,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:06:48,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:06:48,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:06:48,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:06:48,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:06:48,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:06:48,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:06:48,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:06:48,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:06:48,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:06:48,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:06:48,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:06:48,468 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3866fcabc53f8729ce5445d739af818fee4df02a7fd7be02b76364ea8cb9d346 [2024-11-22 13:06:48,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:06:48,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:06:48,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:06:48,730 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:06:48,730 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:06:48,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i [2024-11-22 13:06:50,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:06:50,264 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:06:50,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i [2024-11-22 13:06:50,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e2abbab3/e79d76b1047348159e93e9e9201a372d/FLAG67b3360c9 [2024-11-22 13:06:50,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e2abbab3/e79d76b1047348159e93e9e9201a372d [2024-11-22 13:06:50,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:06:50,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:06:50,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:06:50,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:06:50,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:06:50,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:06:50" (1/1) ... [2024-11-22 13:06:50,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62242d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:50, skipping insertion in model container [2024-11-22 13:06:50,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:06:50" (1/1) ... [2024-11-22 13:06:50,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:06:50,899 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i[916,929] [2024-11-22 13:06:50,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:06:50,950 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:06:50,959 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i[916,929] [2024-11-22 13:06:50,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:06:51,016 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:06:51,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:51 WrapperNode [2024-11-22 13:06:51,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:06:51,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:06:51,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:06:51,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:06:51,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:51" (1/1) ... [2024-11-22 13:06:51,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:51" (1/1) ... [2024-11-22 13:06:51,065 INFO L138 Inliner]: procedures = 30, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 541 [2024-11-22 13:06:51,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:06:51,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:06:51,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:06:51,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:06:51,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:51" (1/1) ... [2024-11-22 13:06:51,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:51" (1/1) ... [2024-11-22 13:06:51,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:51" (1/1) ... [2024-11-22 13:06:51,087 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-22 13:06:51,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:51" (1/1) ... [2024-11-22 13:06:51,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:51" (1/1) ... [2024-11-22 13:06:51,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:51" (1/1) ... [2024-11-22 13:06:51,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:51" (1/1) ... [2024-11-22 13:06:51,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:51" (1/1) ... [2024-11-22 13:06:51,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:51" (1/1) ... [2024-11-22 13:06:51,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:06:51,116 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:06:51,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:06:51,116 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:06:51,117 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:51" (1/1) ... [2024-11-22 13:06:51,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:06:51,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:06:51,152 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-22 13:06:51,161 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-22 13:06:51,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:06:51,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-22 13:06:51,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-22 13:06:51,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-22 13:06:51,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-22 13:06:51,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-22 13:06:51,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-22 13:06:51,212 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:06:51,212 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:06:51,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-22 13:06:51,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:06:51,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:06:51,310 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:06:51,312 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:06:51,943 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2024-11-22 13:06:51,943 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:06:51,956 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:06:51,957 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:06:51,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:06:51 BoogieIcfgContainer [2024-11-22 13:06:51,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:06:51,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:06:51,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:06:51,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:06:51,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:06:50" (1/3) ... [2024-11-22 13:06:51,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b9a0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:06:51, skipping insertion in model container [2024-11-22 13:06:51,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:51" (2/3) ... [2024-11-22 13:06:51,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b9a0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:06:51, skipping insertion in model container [2024-11-22 13:06:51,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:06:51" (3/3) ... [2024-11-22 13:06:51,964 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-43.i [2024-11-22 13:06:51,975 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:06:51,976 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:06:52,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:06:52,026 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;@5b6e975f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:06:52,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:06:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:06:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:06:52,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:06:52,041 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:06:52,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:06:52,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:06:52,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2025586780, now seen corresponding path program 1 times [2024-11-22 13:06:52,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:06:52,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261208592] [2024-11-22 13:06:52,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:06:52,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:06:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:06:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-22 13:06:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:06:52,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261208592] [2024-11-22 13:06:52,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261208592] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:06:52,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848008294] [2024-11-22 13:06:52,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:06:52,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:06:52,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:06:52,484 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-22 13:06:52,488 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-22 13:06:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:06:52,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 13:06:52,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:06:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-22 13:06:52,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:06:52,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848008294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:06:52,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:06:52,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 13:06:52,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17808950] [2024-11-22 13:06:52,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:06:52,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:06:52,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:06:52,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:06:52,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:06:52,858 INFO L87 Difference]: Start difference. First operand has 126 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:06:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:06:52,888 INFO L93 Difference]: Finished difference Result 245 states and 388 transitions. [2024-11-22 13:06:52,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:06:52,892 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2024-11-22 13:06:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:06:52,898 INFO L225 Difference]: With dead ends: 245 [2024-11-22 13:06:52,898 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 13:06:52,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:06:52,904 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:06:52,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:06:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 13:06:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-22 13:06:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:06:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2024-11-22 13:06:52,942 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 168 [2024-11-22 13:06:52,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:06:52,942 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2024-11-22 13:06:52,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:06:52,943 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2024-11-22 13:06:52,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:06:52,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:06:52,946 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:06:52,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 13:06:53,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 13:06:53,150 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:06:53,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:06:53,151 INFO L85 PathProgramCache]: Analyzing trace with hash 176494844, now seen corresponding path program 1 times [2024-11-22 13:06:53,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:06:53,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388156204] [2024-11-22 13:06:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:06:53,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:06:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:06:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:06:53,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:06:53,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388156204] [2024-11-22 13:06:53,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388156204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:06:53,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:06:53,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:06:53,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874890985] [2024-11-22 13:06:53,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:06:53,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:06:53,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:06:53,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:06:53,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:06:53,404 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:06:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:06:53,457 INFO L93 Difference]: Finished difference Result 243 states and 360 transitions. [2024-11-22 13:06:53,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:06:53,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2024-11-22 13:06:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:06:53,459 INFO L225 Difference]: With dead ends: 243 [2024-11-22 13:06:53,460 INFO L226 Difference]: Without dead ends: 124 [2024-11-22 13:06:53,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:06:53,461 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:06:53,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:06:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-22 13:06:53,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-22 13:06:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 102 states have (on average 1.392156862745098) internal successors, (142), 102 states have internal predecessors, (142), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:06:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2024-11-22 13:06:53,477 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 168 [2024-11-22 13:06:53,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:06:53,478 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2024-11-22 13:06:53,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:06:53,479 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2024-11-22 13:06:53,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:06:53,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:06:53,480 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:06:53,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:06:53,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:06:53,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:06:53,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1720484614, now seen corresponding path program 1 times [2024-11-22 13:06:53,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:06:53,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956826582] [2024-11-22 13:06:53,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:06:53,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:06:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:06:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:06:53,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:06:53,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956826582] [2024-11-22 13:06:53,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956826582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:06:53,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:06:53,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:06:53,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29815968] [2024-11-22 13:06:53,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:06:53,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:06:53,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:06:53,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:06:53,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:06:53,722 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:06:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:06:53,761 INFO L93 Difference]: Finished difference Result 248 states and 365 transitions. [2024-11-22 13:06:53,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:06:53,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2024-11-22 13:06:53,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:06:53,765 INFO L225 Difference]: With dead ends: 248 [2024-11-22 13:06:53,766 INFO L226 Difference]: Without dead ends: 127 [2024-11-22 13:06:53,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:06:53,767 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:06:53,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 520 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:06:53,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-22 13:06:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-11-22 13:06:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:06:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 184 transitions. [2024-11-22 13:06:53,783 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 184 transitions. Word has length 168 [2024-11-22 13:06:53,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:06:53,784 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 184 transitions. [2024-11-22 13:06:53,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:06:53,784 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 184 transitions. [2024-11-22 13:06:53,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:06:53,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:06:53,789 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:06:53,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:06:53,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:06:53,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:06:53,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1040426244, now seen corresponding path program 1 times [2024-11-22 13:06:53,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:06:53,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138811158] [2024-11-22 13:06:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:06:53,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:06:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:06:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:06:53,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:06:53,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138811158] [2024-11-22 13:06:53,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138811158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:06:53,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:06:53,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:06:53,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793202687] [2024-11-22 13:06:53,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:06:53,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:06:53,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:06:53,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:06:53,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:06:53,969 INFO L87 Difference]: Start difference. First operand 126 states and 184 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:06:53,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:06:53,993 INFO L93 Difference]: Finished difference Result 252 states and 369 transitions. [2024-11-22 13:06:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:06:53,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2024-11-22 13:06:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:06:53,996 INFO L225 Difference]: With dead ends: 252 [2024-11-22 13:06:53,997 INFO L226 Difference]: Without dead ends: 129 [2024-11-22 13:06:53,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:06:53,999 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:06:53,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 521 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:06:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-22 13:06:54,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2024-11-22 13:06:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:06:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2024-11-22 13:06:54,013 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 168 [2024-11-22 13:06:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:06:54,014 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2024-11-22 13:06:54,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:06:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2024-11-22 13:06:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:06:54,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:06:54,017 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:06:54,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:06:54,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:06:54,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:06:54,018 INFO L85 PathProgramCache]: Analyzing trace with hash 734581118, now seen corresponding path program 1 times [2024-11-22 13:06:54,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:06:54,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765580759] [2024-11-22 13:06:54,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:06:54,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:06:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:06:54,177 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:06:54,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:06:54,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765580759] [2024-11-22 13:06:54,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765580759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:06:54,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:06:54,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:06:54,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018539334] [2024-11-22 13:06:54,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:06:54,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:06:54,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:06:54,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:06:54,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:06:54,182 INFO L87 Difference]: Start difference. First operand 128 states and 186 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:06:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:06:54,205 INFO L93 Difference]: Finished difference Result 256 states and 373 transitions. [2024-11-22 13:06:54,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:06:54,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2024-11-22 13:06:54,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:06:54,207 INFO L225 Difference]: With dead ends: 256 [2024-11-22 13:06:54,208 INFO L226 Difference]: Without dead ends: 131 [2024-11-22 13:06:54,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:06:54,209 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:06:54,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:06:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-22 13:06:54,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-22 13:06:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:06:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 188 transitions. [2024-11-22 13:06:54,221 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 188 transitions. Word has length 168 [2024-11-22 13:06:54,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:06:54,221 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 188 transitions. [2024-11-22 13:06:54,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:06:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 188 transitions. [2024-11-22 13:06:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:06:54,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:06:54,222 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:06:54,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 13:06:54,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:06:54,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:06:54,223 INFO L85 PathProgramCache]: Analyzing trace with hash 736428160, now seen corresponding path program 1 times [2024-11-22 13:06:54,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:06:54,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877991113] [2024-11-22 13:06:54,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:06:54,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:06:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:06:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:06:54,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:06:54,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877991113] [2024-11-22 13:06:54,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877991113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:06:54,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:06:54,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:06:54,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565743558] [2024-11-22 13:06:54,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:06:54,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:06:54,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:06:54,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:06:54,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:06:54,828 INFO L87 Difference]: Start difference. First operand 130 states and 188 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:06:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:06:55,184 INFO L93 Difference]: Finished difference Result 371 states and 535 transitions. [2024-11-22 13:06:55,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:06:55,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2024-11-22 13:06:55,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:06:55,187 INFO L225 Difference]: With dead ends: 371 [2024-11-22 13:06:55,187 INFO L226 Difference]: Without dead ends: 244 [2024-11-22 13:06:55,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:06:55,189 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 136 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:06:55,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1005 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:06:55,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-22 13:06:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 138. [2024-11-22 13:06:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:06:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 199 transitions. [2024-11-22 13:06:55,203 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 199 transitions. Word has length 168 [2024-11-22 13:06:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:06:55,204 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 199 transitions. [2024-11-22 13:06:55,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:06:55,204 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 199 transitions. [2024-11-22 13:06:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:06:55,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:06:55,206 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:06:55,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:06:55,206 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:06:55,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:06:55,207 INFO L85 PathProgramCache]: Analyzing trace with hash -284640194, now seen corresponding path program 1 times [2024-11-22 13:06:55,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:06:55,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876166916] [2024-11-22 13:06:55,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:06:55,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:06:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:06:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:06:56,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:06:56,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876166916] [2024-11-22 13:06:56,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876166916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:06:56,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:06:56,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:06:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951870911] [2024-11-22 13:06:56,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:06:56,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:06:56,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:06:56,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:06:56,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:06:56,096 INFO L87 Difference]: Start difference. First operand 138 states and 199 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:06:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:06:56,815 INFO L93 Difference]: Finished difference Result 378 states and 544 transitions. [2024-11-22 13:06:56,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:06:56,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2024-11-22 13:06:56,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:06:56,818 INFO L225 Difference]: With dead ends: 378 [2024-11-22 13:06:56,818 INFO L226 Difference]: Without dead ends: 243 [2024-11-22 13:06:56,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:06:56,819 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 132 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 13:06:56,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 809 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 13:06:56,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-22 13:06:56,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 138. [2024-11-22 13:06:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:06:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 198 transitions. [2024-11-22 13:06:56,827 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 198 transitions. Word has length 168 [2024-11-22 13:06:56,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:06:56,828 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 198 transitions. [2024-11-22 13:06:56,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:06:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 198 transitions. [2024-11-22 13:06:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 13:06:56,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:06:56,830 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:06:56,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 13:06:56,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:06:56,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:06:56,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1058318679, now seen corresponding path program 1 times [2024-11-22 13:06:56,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:06:56,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784204298] [2024-11-22 13:06:56,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:06:56,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:06:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:06:57,865 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-22 13:06:57,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:06:57,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784204298] [2024-11-22 13:06:57,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784204298] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:06:57,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931872907] [2024-11-22 13:06:57,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:06:57,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:06:57,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:06:57,868 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-22 13:06:57,869 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-22 13:06:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:06:58,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-22 13:06:58,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:06:58,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-22 13:06:58,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-22 13:06:58,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-22 13:06:58,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-22 13:06:58,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-22 13:06:58,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-22 13:06:58,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-22 13:06:58,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:06:58,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 49 [2024-11-22 13:06:58,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:06:58,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 13 [2024-11-22 13:06:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-22 13:06:58,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:06:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-22 13:06:58,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931872907] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:06:58,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:06:58,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 16 [2024-11-22 13:06:58,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843362129] [2024-11-22 13:06:58,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:06:58,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 13:06:58,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:06:58,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 13:06:58,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-22 13:06:58,698 INFO L87 Difference]: Start difference. First operand 138 states and 198 transitions. Second operand has 16 states, 13 states have (on average 9.538461538461538) internal successors, (124), 16 states have internal predecessors, (124), 7 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 4 states have call predecessors, (52), 7 states have call successors, (52) [2024-11-22 13:06:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:06:59,355 INFO L93 Difference]: Finished difference Result 315 states and 449 transitions. [2024-11-22 13:06:59,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 13:06:59,356 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 9.538461538461538) internal successors, (124), 16 states have internal predecessors, (124), 7 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 4 states have call predecessors, (52), 7 states have call successors, (52) Word has length 168 [2024-11-22 13:06:59,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:06:59,357 INFO L225 Difference]: With dead ends: 315 [2024-11-22 13:06:59,357 INFO L226 Difference]: Without dead ends: 180 [2024-11-22 13:06:59,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2024-11-22 13:06:59,358 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 328 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 13:06:59,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 645 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 13:06:59,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-22 13:06:59,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2024-11-22 13:06:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 149 states have (on average 1.3557046979865772) internal successors, (202), 150 states have internal predecessors, (202), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 13:06:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 250 transitions. [2024-11-22 13:06:59,373 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 250 transitions. Word has length 168 [2024-11-22 13:06:59,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:06:59,373 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 250 transitions. [2024-11-22 13:06:59,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 9.538461538461538) internal successors, (124), 16 states have internal predecessors, (124), 7 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 4 states have call predecessors, (52), 7 states have call successors, (52) [2024-11-22 13:06:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 250 transitions. [2024-11-22 13:06:59,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-22 13:06:59,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:06:59,378 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:06:59,394 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-22 13:06:59,579 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,SelfDestructingSolverStorable7 [2024-11-22 13:06:59,579 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:06:59,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:06:59,580 INFO L85 PathProgramCache]: Analyzing trace with hash 39089738, now seen corresponding path program 1 times [2024-11-22 13:06:59,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:06:59,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597228244] [2024-11-22 13:06:59,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:06:59,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:06:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-22 13:07:00,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:07:00,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597228244] [2024-11-22 13:07:00,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597228244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:07:00,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619804550] [2024-11-22 13:07:00,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:00,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:07:00,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:07:00,545 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-22 13:07:00,546 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-22 13:07:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:00,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 13:07:00,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:07:00,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-22 13:07:00,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-22 13:07:00,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-22 13:07:00,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-22 13:07:00,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-22 13:07:00,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-22 13:07:00,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-22 13:07:00,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:00,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 49 [2024-11-22 13:07:01,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:01,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 13 [2024-11-22 13:07:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-22 13:07:01,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:07:01,258 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-22 13:07:01,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619804550] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:07:01,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:07:01,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 21 [2024-11-22 13:07:01,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480538150] [2024-11-22 13:07:01,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:07:01,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-22 13:07:01,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:07:01,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-22 13:07:01,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-11-22 13:07:01,260 INFO L87 Difference]: Start difference. First operand 177 states and 250 transitions. Second operand has 21 states, 18 states have (on average 6.388888888888889) internal successors, (115), 21 states have internal predecessors, (115), 6 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 3 states have call predecessors, (52), 6 states have call successors, (52) [2024-11-22 13:07:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:02,250 INFO L93 Difference]: Finished difference Result 325 states and 456 transitions. [2024-11-22 13:07:02,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 13:07:02,251 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.388888888888889) internal successors, (115), 21 states have internal predecessors, (115), 6 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 3 states have call predecessors, (52), 6 states have call successors, (52) Word has length 169 [2024-11-22 13:07:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:02,252 INFO L225 Difference]: With dead ends: 325 [2024-11-22 13:07:02,252 INFO L226 Difference]: Without dead ends: 182 [2024-11-22 13:07:02,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2024-11-22 13:07:02,253 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 420 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:02,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 959 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 13:07:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-22 13:07:02,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2024-11-22 13:07:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 151 states have (on average 1.3509933774834437) internal successors, (204), 152 states have internal predecessors, (204), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 13:07:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 252 transitions. [2024-11-22 13:07:02,259 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 252 transitions. Word has length 169 [2024-11-22 13:07:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:02,260 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 252 transitions. [2024-11-22 13:07:02,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.388888888888889) internal successors, (115), 21 states have internal predecessors, (115), 6 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 3 states have call predecessors, (52), 6 states have call successors, (52) [2024-11-22 13:07:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 252 transitions. [2024-11-22 13:07:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-22 13:07:02,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:02,261 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:02,279 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-22 13:07:02,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:07:02,466 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:02,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:02,467 INFO L85 PathProgramCache]: Analyzing trace with hash 179638348, now seen corresponding path program 1 times [2024-11-22 13:07:02,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:07:02,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606323555] [2024-11-22 13:07:02,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:02,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:07:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-22 13:07:02,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:07:02,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606323555] [2024-11-22 13:07:02,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606323555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:02,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:07:02,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:07:02,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10522417] [2024-11-22 13:07:02,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:02,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:07:02,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:07:02,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:07:02,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:07:02,764 INFO L87 Difference]: Start difference. First operand 179 states and 252 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:03,242 INFO L93 Difference]: Finished difference Result 324 states and 451 transitions. [2024-11-22 13:07:03,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 13:07:03,243 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-22 13:07:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:03,245 INFO L225 Difference]: With dead ends: 324 [2024-11-22 13:07:03,245 INFO L226 Difference]: Without dead ends: 179 [2024-11-22 13:07:03,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-11-22 13:07:03,246 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 233 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:03,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 406 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 13:07:03,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-22 13:07:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2024-11-22 13:07:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 146 states have (on average 1.3424657534246576) internal successors, (196), 147 states have internal predecessors, (196), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 13:07:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 244 transitions. [2024-11-22 13:07:03,254 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 244 transitions. Word has length 169 [2024-11-22 13:07:03,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:03,254 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 244 transitions. [2024-11-22 13:07:03,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 244 transitions. [2024-11-22 13:07:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-22 13:07:03,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:03,256 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:03,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 13:07:03,256 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:03,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:03,256 INFO L85 PathProgramCache]: Analyzing trace with hash 280449655, now seen corresponding path program 1 times [2024-11-22 13:07:03,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:07:03,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236213493] [2024-11-22 13:07:03,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:03,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:07:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:07:03,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:07:03,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236213493] [2024-11-22 13:07:03,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236213493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:03,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:07:03,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:07:03,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188418278] [2024-11-22 13:07:03,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:03,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:07:03,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:07:03,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:07:03,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:07:03,699 INFO L87 Difference]: Start difference. First operand 175 states and 244 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:04,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:04,217 INFO L93 Difference]: Finished difference Result 439 states and 605 transitions. [2024-11-22 13:07:04,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:07:04,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-22 13:07:04,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:04,219 INFO L225 Difference]: With dead ends: 439 [2024-11-22 13:07:04,219 INFO L226 Difference]: Without dead ends: 298 [2024-11-22 13:07:04,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:07:04,220 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 229 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:04,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 432 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 13:07:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-22 13:07:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 286. [2024-11-22 13:07:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 236 states have (on average 1.3305084745762712) internal successors, (314), 238 states have internal predecessors, (314), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-22 13:07:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 398 transitions. [2024-11-22 13:07:04,235 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 398 transitions. Word has length 169 [2024-11-22 13:07:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:04,235 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 398 transitions. [2024-11-22 13:07:04,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 398 transitions. [2024-11-22 13:07:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-22 13:07:04,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:04,237 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:04,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 13:07:04,237 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:04,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:04,237 INFO L85 PathProgramCache]: Analyzing trace with hash -740618699, now seen corresponding path program 1 times [2024-11-22 13:07:04,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:07:04,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947160069] [2024-11-22 13:07:04,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:04,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:07:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:05,698 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:07:05,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:07:05,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947160069] [2024-11-22 13:07:05,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947160069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:05,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:07:05,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 13:07:05,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523150303] [2024-11-22 13:07:05,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:05,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:07:05,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:07:05,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:07:05,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:07:05,700 INFO L87 Difference]: Start difference. First operand 286 states and 398 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:07:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:06,275 INFO L93 Difference]: Finished difference Result 972 states and 1343 transitions. [2024-11-22 13:07:06,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:07:06,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-22 13:07:06,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:06,278 INFO L225 Difference]: With dead ends: 972 [2024-11-22 13:07:06,278 INFO L226 Difference]: Without dead ends: 720 [2024-11-22 13:07:06,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-22 13:07:06,279 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 260 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:06,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 940 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 13:07:06,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-22 13:07:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 499. [2024-11-22 13:07:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 406 states have (on average 1.3152709359605912) internal successors, (534), 407 states have internal predecessors, (534), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-22 13:07:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 690 transitions. [2024-11-22 13:07:06,305 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 690 transitions. Word has length 169 [2024-11-22 13:07:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:06,305 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 690 transitions. [2024-11-22 13:07:06,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:07:06,305 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 690 transitions. [2024-11-22 13:07:06,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-22 13:07:06,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:06,307 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:06,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 13:07:06,307 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:06,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:06,307 INFO L85 PathProgramCache]: Analyzing trace with hash 602340174, now seen corresponding path program 1 times [2024-11-22 13:07:06,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:07:06,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160563548] [2024-11-22 13:07:06,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:06,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:07:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:07:06,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:07:06,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160563548] [2024-11-22 13:07:06,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160563548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:06,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:07:06,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:07:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597557457] [2024-11-22 13:07:06,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:06,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:07:06,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:07:06,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:07:06,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:07:06,736 INFO L87 Difference]: Start difference. First operand 499 states and 690 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:07,136 INFO L93 Difference]: Finished difference Result 1174 states and 1612 transitions. [2024-11-22 13:07:07,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:07:07,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-22 13:07:07,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:07,140 INFO L225 Difference]: With dead ends: 1174 [2024-11-22 13:07:07,140 INFO L226 Difference]: Without dead ends: 745 [2024-11-22 13:07:07,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:07:07,142 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 133 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:07,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 541 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 13:07:07,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-22 13:07:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 501. [2024-11-22 13:07:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 408 states have (on average 1.3137254901960784) internal successors, (536), 409 states have internal predecessors, (536), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-22 13:07:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 692 transitions. [2024-11-22 13:07:07,171 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 692 transitions. Word has length 169 [2024-11-22 13:07:07,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:07,173 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 692 transitions. [2024-11-22 13:07:07,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 692 transitions. [2024-11-22 13:07:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-22 13:07:07,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:07,175 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:07,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 13:07:07,175 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:07,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:07,176 INFO L85 PathProgramCache]: Analyzing trace with hash -418728180, now seen corresponding path program 1 times [2024-11-22 13:07:07,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:07:07,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302190674] [2024-11-22 13:07:07,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:07,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:07:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-22 13:07:07,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:07:07,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302190674] [2024-11-22 13:07:07,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302190674] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:07:07,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079551663] [2024-11-22 13:07:07,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:07,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:07:07,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:07:07,345 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-22 13:07:07,347 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-22 13:07:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:07,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 13:07:07,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:07:07,664 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:07:07,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:07:07,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079551663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:07,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:07:07,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-22 13:07:07,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177708318] [2024-11-22 13:07:07,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:07,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:07:07,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:07:07,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:07:07,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:07:07,667 INFO L87 Difference]: Start difference. First operand 501 states and 692 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:07:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:07,711 INFO L93 Difference]: Finished difference Result 941 states and 1298 transitions. [2024-11-22 13:07:07,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:07:07,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-22 13:07:07,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:07,714 INFO L225 Difference]: With dead ends: 941 [2024-11-22 13:07:07,714 INFO L226 Difference]: Without dead ends: 510 [2024-11-22 13:07:07,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:07:07,716 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:07,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 690 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:07:07,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-11-22 13:07:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2024-11-22 13:07:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 415 states have (on average 1.308433734939759) internal successors, (543), 416 states have internal predecessors, (543), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-22 13:07:07,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 699 transitions. [2024-11-22 13:07:07,743 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 699 transitions. Word has length 169 [2024-11-22 13:07:07,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:07,744 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 699 transitions. [2024-11-22 13:07:07,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:07:07,744 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 699 transitions. [2024-11-22 13:07:07,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-22 13:07:07,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:07,745 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:07,753 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-22 13:07:07,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:07:07,946 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:07,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:07,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1586488949, now seen corresponding path program 1 times [2024-11-22 13:07:07,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:07:07,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820319521] [2024-11-22 13:07:07,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:07,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:07:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-22 13:07:08,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:07:08,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820319521] [2024-11-22 13:07:08,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820319521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:08,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:07:08,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:07:08,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560460939] [2024-11-22 13:07:08,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:08,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:07:08,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:07:08,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:07:08,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:07:08,341 INFO L87 Difference]: Start difference. First operand 508 states and 699 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:08,869 INFO L93 Difference]: Finished difference Result 960 states and 1314 transitions. [2024-11-22 13:07:08,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 13:07:08,869 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-22 13:07:08,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:08,872 INFO L225 Difference]: With dead ends: 960 [2024-11-22 13:07:08,872 INFO L226 Difference]: Without dead ends: 522 [2024-11-22 13:07:08,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-11-22 13:07:08,873 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 233 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:08,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 401 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 13:07:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-22 13:07:08,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 508. [2024-11-22 13:07:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 415 states have (on average 1.3012048192771084) internal successors, (540), 416 states have internal predecessors, (540), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-22 13:07:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 696 transitions. [2024-11-22 13:07:08,891 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 696 transitions. Word has length 169 [2024-11-22 13:07:08,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:08,891 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 696 transitions. [2024-11-22 13:07:08,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:08,892 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 696 transitions. [2024-11-22 13:07:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-22 13:07:08,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:08,892 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:08,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 13:07:08,893 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:08,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:08,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2009190775, now seen corresponding path program 1 times [2024-11-22 13:07:08,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:07:08,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391078090] [2024-11-22 13:07:08,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:08,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:07:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:09,227 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:07:09,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:07:09,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391078090] [2024-11-22 13:07:09,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391078090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:09,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:07:09,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:07:09,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174648050] [2024-11-22 13:07:09,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:09,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:07:09,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:07:09,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:07:09,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:07:09,228 INFO L87 Difference]: Start difference. First operand 508 states and 696 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:09,607 INFO L93 Difference]: Finished difference Result 1179 states and 1607 transitions. [2024-11-22 13:07:09,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:07:09,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-22 13:07:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:09,611 INFO L225 Difference]: With dead ends: 1179 [2024-11-22 13:07:09,611 INFO L226 Difference]: Without dead ends: 741 [2024-11-22 13:07:09,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:07:09,612 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 134 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:09,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 585 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:07:09,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-22 13:07:09,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 505. [2024-11-22 13:07:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 412 states have (on average 1.296116504854369) internal successors, (534), 413 states have internal predecessors, (534), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-22 13:07:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 690 transitions. [2024-11-22 13:07:09,632 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 690 transitions. Word has length 169 [2024-11-22 13:07:09,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:09,632 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 690 transitions. [2024-11-22 13:07:09,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 690 transitions. [2024-11-22 13:07:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-22 13:07:09,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:09,633 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:09,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 13:07:09,634 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:09,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:09,634 INFO L85 PathProgramCache]: Analyzing trace with hash 988122421, now seen corresponding path program 1 times [2024-11-22 13:07:09,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:07:09,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442053910] [2024-11-22 13:07:09,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:09,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:07:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 13:07:09,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2091404006] [2024-11-22 13:07:09,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:09,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:07:09,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:07:09,694 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:07:09,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 13:07:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:07:11,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 13:07:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:07:11,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 13:07:11,774 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 13:07:11,774 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 13:07:11,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 13:07:11,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-22 13:07:11,979 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:12,023 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 13:07:12,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:07:12 BoogieIcfgContainer [2024-11-22 13:07:12,028 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 13:07:12,028 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 13:07:12,028 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 13:07:12,028 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 13:07:12,028 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:06:51" (3/4) ... [2024-11-22 13:07:12,030 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 13:07:12,031 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 13:07:12,032 INFO L158 Benchmark]: Toolchain (without parser) took 21351.44ms. Allocated memory was 121.6MB in the beginning and 824.2MB in the end (delta: 702.5MB). Free memory was 48.8MB in the beginning and 595.6MB in the end (delta: -546.8MB). Peak memory consumption was 158.4MB. Max. memory is 16.1GB. [2024-11-22 13:07:12,032 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:07:12,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.59ms. Allocated memory is still 121.6MB. Free memory was 48.5MB in the beginning and 75.8MB in the end (delta: -27.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 13:07:12,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.77ms. Allocated memory is still 121.6MB. Free memory was 75.8MB in the beginning and 71.1MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:07:12,033 INFO L158 Benchmark]: Boogie Preprocessor took 49.54ms. Allocated memory is still 121.6MB. Free memory was 71.1MB in the beginning and 67.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:07:12,033 INFO L158 Benchmark]: RCFGBuilder took 842.16ms. Allocated memory is still 121.6MB. Free memory was 67.0MB in the beginning and 75.4MB in the end (delta: -8.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2024-11-22 13:07:12,033 INFO L158 Benchmark]: TraceAbstraction took 20068.18ms. Allocated memory was 121.6MB in the beginning and 824.2MB in the end (delta: 702.5MB). Free memory was 74.7MB in the beginning and 595.6MB in the end (delta: -520.9MB). Peak memory consumption was 181.9MB. Max. memory is 16.1GB. [2024-11-22 13:07:12,033 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 824.2MB. Free memory is still 595.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:07:12,034 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.14ms. Allocated memory is still 121.6MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.59ms. Allocated memory is still 121.6MB. Free memory was 48.5MB in the beginning and 75.8MB in the end (delta: -27.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.77ms. Allocated memory is still 121.6MB. Free memory was 75.8MB in the beginning and 71.1MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.54ms. Allocated memory is still 121.6MB. Free memory was 71.1MB in the beginning and 67.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 842.16ms. Allocated memory is still 121.6MB. Free memory was 67.0MB in the beginning and 75.4MB in the end (delta: -8.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 20068.18ms. Allocated memory was 121.6MB in the beginning and 824.2MB in the end (delta: 702.5MB). Free memory was 74.7MB in the beginning and 595.6MB in the end (delta: -520.9MB). Peak memory consumption was 181.9MB. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 824.2MB. Free memory is still 595.6MB. There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 131. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 64, 4.5, 64.8, 64.4, 0.2, 10000, 1, 50, 8, 2, 100, 128, 23647, 32, 0, -50, 0, 0 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] FCALL updateLastVariables() [L139] CALL updateVariables() [L95] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_2 [L96] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_2 [L96] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L98] EXPR WrapperStruct00.var_1_3 [L98] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_3 [L98] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L100] EXPR WrapperStruct00.var_1_4 [L100] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_4 [L100] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L102] EXPR WrapperStruct00.var_1_5 [L102] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_5 [L102] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_7 = __VERIFIER_nondet_short() [L104] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] WrapperStruct00.var_1_8 = __VERIFIER_nondet_short() [L107] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 8192) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 8192) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L110] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_10 = __VERIFIER_nondet_short() [L113] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ushort() [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L121] WrapperStruct00.var_1_19 = __VERIFIER_nondet_char() [L122] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L123] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L124] WrapperStruct00.var_1_21 = __VERIFIER_nondet_uchar() [L125] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_21 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_21 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L126] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_21 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_21 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L139] RET updateVariables() [L140] CALL step() [L66] EXPR WrapperStruct00.var_1_19 [L66] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L67] EXPR WrapperStruct00.var_1_21 [L67] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_21 [L68] EXPR WrapperStruct00.var_1_18 [L68] signed char stepLocal_1 = WrapperStruct00.var_1_18; [L69] EXPR WrapperStruct00.var_1_9 [L69] EXPR WrapperStruct00.var_1_7 [L69] signed long int stepLocal_0 = WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7; [L70] EXPR WrapperStruct00.var_1_8 [L70] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0, stepLocal_1=0] [L70] EXPR WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0, stepLocal_1=0] [L70] COND FALSE !(stepLocal_1 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) [L77] EXPR WrapperStruct00.var_1_7 [L77] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L77] EXPR WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L77] signed long int stepLocal_2 = WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18; [L78] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0, stepLocal_2=8191] [L78] COND FALSE !(WrapperStruct00.var_1_14 >= stepLocal_2) [L81] EXPR WrapperStruct00.var_1_2 [L81] EXPR WrapperStruct00.var_1_3 [L81] EXPR WrapperStruct00.var_1_4 [L81] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L81] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) [L81] EXPR WrapperStruct00.var_1_3 [L81] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L81] COND TRUE WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) [L82] WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L82] COND FALSE !(WrapperStruct00.var_1_20) [L92] EXPR WrapperStruct00.var_1_1 [L92] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_1 [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR WrapperStruct00.var_1_2 [L131] EXPR WrapperStruct00.var_1_3 [L131] EXPR WrapperStruct00.var_1_4 [L131] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) [L131] EXPR WrapperStruct00.var_1_3 [L131] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13))) [L131] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)) [L131] EXPR WrapperStruct00.var_1_1 [L131] EXPR WrapperStruct00.var_1_13 [L131] EXPR WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1)) && (WrapperStruct00.var_1_17 == ((unsigned short int) WrapperStruct00.var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (((((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1)) && (WrapperStruct00.var_1_17 == ((unsigned short int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_18 == ((signed char) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((((((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1)) && (WrapperStruct00.var_1_17 == ((unsigned short int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_18 == ((signed char) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((unsigned char) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131-L132] return ((((((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1)) && (WrapperStruct00.var_1_17 == ((unsigned short int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_18 == ((signed char) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((unsigned char) WrapperStruct00.var_1_21)) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.0s, OverallIterations: 17, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2265 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2241 mSDsluCounter, 9680 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7158 mSDsCounter, 482 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5344 IncrementalHoareTripleChecker+Invalid, 5826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 482 mSolverCounterUnsat, 2522 mSDtfsCounter, 5344 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1207 GetRequests, 1072 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=508occurred in iteration=14, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 953 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 3708 NumberOfCodeBlocks, 3708 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3685 ConstructedInterpolants, 0 QuantifiedInterpolants, 8249 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2497 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 16391/16720 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 could not prove your program: unable to determine feasibility of some traces [2024-11-22 13:07:12,067 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3866fcabc53f8729ce5445d739af818fee4df02a7fd7be02b76364ea8cb9d346 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:07:14,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:07:14,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 13:07:14,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:07:14,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:07:14,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:07:14,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:07:14,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:07:14,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:07:14,499 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:07:14,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:07:14,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:07:14,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:07:14,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:07:14,503 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:07:14,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:07:14,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:07:14,504 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:07:14,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:07:14,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:07:14,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:07:14,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:07:14,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:07:14,507 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 13:07:14,507 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 13:07:14,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:07:14,508 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 13:07:14,508 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:07:14,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:07:14,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:07:14,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:07:14,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:07:14,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:07:14,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:07:14,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:07:14,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:07:14,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:07:14,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:07:14,510 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 13:07:14,510 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 13:07:14,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:07:14,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:07:14,513 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:07:14,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:07:14,513 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3866fcabc53f8729ce5445d739af818fee4df02a7fd7be02b76364ea8cb9d346 [2024-11-22 13:07:14,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:07:14,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:07:14,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:07:14,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:07:14,816 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:07:14,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i [2024-11-22 13:07:16,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:07:16,373 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:07:16,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i [2024-11-22 13:07:16,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3343072/18eac7422fcd4a1da9cfa8f12ef4c0f0/FLAGc1c175a55 [2024-11-22 13:07:16,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3343072/18eac7422fcd4a1da9cfa8f12ef4c0f0 [2024-11-22 13:07:16,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:07:16,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:07:16,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:07:16,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:07:16,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:07:16,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:07:16" (1/1) ... [2024-11-22 13:07:16,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d2adce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:16, skipping insertion in model container [2024-11-22 13:07:16,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:07:16" (1/1) ... [2024-11-22 13:07:16,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:07:16,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i[916,929] [2024-11-22 13:07:16,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:07:16,667 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:07:16,676 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i[916,929] [2024-11-22 13:07:16,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:07:16,737 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:07:16,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:16 WrapperNode [2024-11-22 13:07:16,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:07:16,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:07:16,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:07:16,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:07:16,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:16" (1/1) ... [2024-11-22 13:07:16,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:16" (1/1) ... [2024-11-22 13:07:16,809 INFO L138 Inliner]: procedures = 34, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2024-11-22 13:07:16,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:07:16,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:07:16,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:07:16,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:07:16,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:16" (1/1) ... [2024-11-22 13:07:16,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:16" (1/1) ... [2024-11-22 13:07:16,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:16" (1/1) ... [2024-11-22 13:07:16,850 INFO L175 MemorySlicer]: Split 145 memory accesses to 2 slices as follows [2, 143]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 40 writes are split as follows [0, 40]. [2024-11-22 13:07:16,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:16" (1/1) ... [2024-11-22 13:07:16,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:16" (1/1) ... [2024-11-22 13:07:16,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:16" (1/1) ... [2024-11-22 13:07:16,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:16" (1/1) ... [2024-11-22 13:07:16,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:16" (1/1) ... [2024-11-22 13:07:16,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:16" (1/1) ... [2024-11-22 13:07:16,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:07:16,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:07:16,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:07:16,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:07:16,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:16" (1/1) ... [2024-11-22 13:07:16,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:07:16,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:07:16,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 13:07:16,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 13:07:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:07:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 13:07:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 13:07:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 13:07:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 13:07:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-22 13:07:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-22 13:07:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-22 13:07:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-22 13:07:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-22 13:07:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-22 13:07:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-22 13:07:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-22 13:07:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-22 13:07:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-22 13:07:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:07:16,962 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:07:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-22 13:07:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-22 13:07:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:07:16,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:07:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 13:07:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 13:07:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-22 13:07:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-22 13:07:17,083 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:07:17,084 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:07:18,362 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2024-11-22 13:07:18,362 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:07:18,376 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:07:18,376 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:07:18,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:07:18 BoogieIcfgContainer [2024-11-22 13:07:18,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:07:18,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:07:18,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:07:18,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:07:18,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:07:16" (1/3) ... [2024-11-22 13:07:18,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692e616b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:07:18, skipping insertion in model container [2024-11-22 13:07:18,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:07:16" (2/3) ... [2024-11-22 13:07:18,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692e616b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:07:18, skipping insertion in model container [2024-11-22 13:07:18,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:07:18" (3/3) ... [2024-11-22 13:07:18,395 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-43.i [2024-11-22 13:07:18,406 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:07:18,407 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:07:18,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:07:18,457 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;@20ef062d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:07:18,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:07:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:07:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-22 13:07:18,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:18,471 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:18,471 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:18,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:18,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1561133314, now seen corresponding path program 1 times [2024-11-22 13:07:18,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:07:18,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301463436] [2024-11-22 13:07:18,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:18,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:18,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:07:18,488 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:07:18,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 13:07:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:18,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 13:07:18,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:07:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-22 13:07:18,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:07:18,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:07:18,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301463436] [2024-11-22 13:07:18,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301463436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:18,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:07:18,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:07:18,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112066620] [2024-11-22 13:07:18,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:18,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:07:18,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:07:18,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:07:18,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:07:18,953 INFO L87 Difference]: Start difference. First operand has 113 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:18,980 INFO L93 Difference]: Finished difference Result 219 states and 346 transitions. [2024-11-22 13:07:18,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:07:18,982 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-22 13:07:18,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:18,988 INFO L225 Difference]: With dead ends: 219 [2024-11-22 13:07:18,988 INFO L226 Difference]: Without dead ends: 109 [2024-11-22 13:07:18,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:07:18,993 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:18,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:07:19,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-22 13:07:19,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-22 13:07:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:07:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2024-11-22 13:07:19,027 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 165 [2024-11-22 13:07:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:19,028 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2024-11-22 13:07:19,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:19,028 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2024-11-22 13:07:19,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-22 13:07:19,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:19,031 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:19,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 13:07:19,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:19,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:19,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:19,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1953213538, now seen corresponding path program 1 times [2024-11-22 13:07:19,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:07:19,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291216510] [2024-11-22 13:07:19,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:19,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:19,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:07:19,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:07:19,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 13:07:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:19,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 13:07:19,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:07:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:07:19,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:07:19,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:07:19,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291216510] [2024-11-22 13:07:19,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291216510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:19,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:07:19,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:07:19,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629479066] [2024-11-22 13:07:19,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:19,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:07:19,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:07:19,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:07:19,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:07:19,658 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:07:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:19,705 INFO L93 Difference]: Finished difference Result 220 states and 322 transitions. [2024-11-22 13:07:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:07:19,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 165 [2024-11-22 13:07:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:19,707 INFO L225 Difference]: With dead ends: 220 [2024-11-22 13:07:19,707 INFO L226 Difference]: Without dead ends: 114 [2024-11-22 13:07:19,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:07:19,709 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:19,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 600 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:07:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-22 13:07:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-22 13:07:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:07:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-11-22 13:07:19,720 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 165 [2024-11-22 13:07:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:19,721 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-11-22 13:07:19,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:07:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-11-22 13:07:19,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-22 13:07:19,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:19,723 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:19,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 13:07:19,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:19,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:19,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:19,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1661695388, now seen corresponding path program 1 times [2024-11-22 13:07:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:07:19,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516668682] [2024-11-22 13:07:19,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:19,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:19,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:07:19,939 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:07:19,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 13:07:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:20,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 13:07:20,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:07:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:07:20,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:07:20,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:07:20,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516668682] [2024-11-22 13:07:20,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516668682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:20,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:07:20,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:07:20,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964169061] [2024-11-22 13:07:20,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:20,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:07:20,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:07:20,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:07:20,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:07:20,354 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:07:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:20,403 INFO L93 Difference]: Finished difference Result 226 states and 327 transitions. [2024-11-22 13:07:20,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:07:20,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 165 [2024-11-22 13:07:20,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:20,405 INFO L225 Difference]: With dead ends: 226 [2024-11-22 13:07:20,405 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 13:07:20,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:07:20,406 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:20,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 740 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:07:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 13:07:20,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-22 13:07:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:07:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2024-11-22 13:07:20,415 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 165 [2024-11-22 13:07:20,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:20,415 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2024-11-22 13:07:20,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:07:20,415 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2024-11-22 13:07:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-22 13:07:20,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:20,417 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:20,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 13:07:20,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:20,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:20,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:20,623 INFO L85 PathProgramCache]: Analyzing trace with hash 113311974, now seen corresponding path program 1 times [2024-11-22 13:07:20,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:07:20,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011605184] [2024-11-22 13:07:20,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:20,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:20,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:07:20,632 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:07:20,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 13:07:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:20,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 13:07:20,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:07:21,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-22 13:07:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-22 13:07:21,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:07:21,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:07:21,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011605184] [2024-11-22 13:07:21,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011605184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:21,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:07:21,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:07:21,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883582461] [2024-11-22 13:07:21,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:21,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:07:21,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:07:21,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:07:21,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:07:21,096 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:22,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:22,104 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2024-11-22 13:07:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:07:22,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-22 13:07:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:22,105 INFO L225 Difference]: With dead ends: 228 [2024-11-22 13:07:22,106 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 13:07:22,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:07:22,111 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 139 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:22,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 460 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 13:07:22,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 13:07:22,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-22 13:07:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:07:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2024-11-22 13:07:22,135 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 165 [2024-11-22 13:07:22,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:22,136 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2024-11-22 13:07:22,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2024-11-22 13:07:22,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-22 13:07:22,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:22,138 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:22,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-22 13:07:22,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:22,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:22,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:22,339 INFO L85 PathProgramCache]: Analyzing trace with hash -709761824, now seen corresponding path program 1 times [2024-11-22 13:07:22,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:07:22,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880851066] [2024-11-22 13:07:22,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:22,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:22,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:07:22,343 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:07:22,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 13:07:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:22,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 13:07:22,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:07:22,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-22 13:07:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-22 13:07:22,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:07:22,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:07:22,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880851066] [2024-11-22 13:07:22,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880851066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:22,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:07:22,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:07:22,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303626797] [2024-11-22 13:07:22,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:22,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:07:22,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:07:22,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:07:22,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:07:22,807 INFO L87 Difference]: Start difference. First operand 115 states and 164 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:23,795 INFO L93 Difference]: Finished difference Result 228 states and 326 transitions. [2024-11-22 13:07:23,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:07:23,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 167 [2024-11-22 13:07:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:23,797 INFO L225 Difference]: With dead ends: 228 [2024-11-22 13:07:23,797 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 13:07:23,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:07:23,798 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 129 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:23,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 456 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 13:07:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 13:07:23,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-22 13:07:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:07:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-22 13:07:23,808 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 167 [2024-11-22 13:07:23,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:23,809 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-22 13:07:23,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-22 13:07:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-22 13:07:23,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:23,810 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:23,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 13:07:24,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:24,015 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:24,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:24,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1995820070, now seen corresponding path program 1 times [2024-11-22 13:07:24,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:07:24,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722233546] [2024-11-22 13:07:24,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:24,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:24,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:07:24,018 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:07:24,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 13:07:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:24,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 13:07:24,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:07:24,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:24,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2024-11-22 13:07:24,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:24,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 100 [2024-11-22 13:07:24,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:24,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 95 treesize of output 35 [2024-11-22 13:07:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-22 13:07:24,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:07:24,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:07:24,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722233546] [2024-11-22 13:07:24,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722233546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:24,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:07:24,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 13:07:24,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748903039] [2024-11-22 13:07:24,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:24,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:07:24,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:07:24,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:07:24,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:07:24,993 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:29,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:29,665 INFO L93 Difference]: Finished difference Result 386 states and 543 transitions. [2024-11-22 13:07:29,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 13:07:29,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-22 13:07:29,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:29,669 INFO L225 Difference]: With dead ends: 386 [2024-11-22 13:07:29,669 INFO L226 Difference]: Without dead ends: 274 [2024-11-22 13:07:29,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-22 13:07:29,673 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 346 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:29,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 515 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-22 13:07:29,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-22 13:07:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2024-11-22 13:07:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 211 states have (on average 1.3080568720379147) internal successors, (276), 213 states have internal predecessors, (276), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 13:07:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 372 transitions. [2024-11-22 13:07:29,741 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 372 transitions. Word has length 169 [2024-11-22 13:07:29,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:29,741 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 372 transitions. [2024-11-22 13:07:29,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 372 transitions. [2024-11-22 13:07:29,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-22 13:07:29,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:29,743 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:29,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-22 13:07:29,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:29,944 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:29,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:29,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1876445400, now seen corresponding path program 1 times [2024-11-22 13:07:29,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:07:29,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433869418] [2024-11-22 13:07:29,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:29,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:29,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:07:29,948 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:07:29,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 13:07:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:30,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 13:07:30,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:07:30,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:30,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2024-11-22 13:07:30,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:30,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 100 [2024-11-22 13:07:30,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:30,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 105 treesize of output 113 [2024-11-22 13:07:30,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:30,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 120 treesize of output 127 [2024-11-22 13:07:30,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:30,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 131 treesize of output 49 [2024-11-22 13:07:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-22 13:07:30,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:07:30,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:07:30,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433869418] [2024-11-22 13:07:30,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433869418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:30,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:07:30,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 13:07:30,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212337719] [2024-11-22 13:07:30,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:30,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 13:07:30,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:07:30,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 13:07:30,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:07:30,998 INFO L87 Difference]: Start difference. First operand 264 states and 372 transitions. Second operand has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:38,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:38,114 INFO L93 Difference]: Finished difference Result 568 states and 790 transitions. [2024-11-22 13:07:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-22 13:07:38,115 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-22 13:07:38,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:38,117 INFO L225 Difference]: With dead ends: 568 [2024-11-22 13:07:38,117 INFO L226 Difference]: Without dead ends: 360 [2024-11-22 13:07:38,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2024-11-22 13:07:38,118 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 520 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:38,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 660 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-22 13:07:38,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-22 13:07:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 264. [2024-11-22 13:07:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 211 states have (on average 1.2985781990521328) internal successors, (274), 213 states have internal predecessors, (274), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 13:07:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 370 transitions. [2024-11-22 13:07:38,167 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 370 transitions. Word has length 169 [2024-11-22 13:07:38,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:38,167 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 370 transitions. [2024-11-22 13:07:38,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 370 transitions. [2024-11-22 13:07:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-22 13:07:38,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:38,169 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:38,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 13:07:38,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:38,370 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:38,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:38,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1397453542, now seen corresponding path program 1 times [2024-11-22 13:07:38,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:07:38,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182577034] [2024-11-22 13:07:38,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:38,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:38,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:07:38,373 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:07:38,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 13:07:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:38,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-22 13:07:38,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:07:38,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:07:38,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 91 [2024-11-22 13:07:39,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:39,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 118 [2024-11-22 13:07:39,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:39,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 118 [2024-11-22 13:07:39,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:39,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 118 [2024-11-22 13:07:40,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:40,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 118 [2024-11-22 13:07:40,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:40,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 105 treesize of output 119 [2024-11-22 13:07:41,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:41,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 109 [2024-11-22 13:07:41,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:41,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 95 treesize of output 115 [2024-11-22 13:07:41,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:41,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 105 treesize of output 119 [2024-11-22 13:07:42,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:42,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 105 treesize of output 119 [2024-11-22 13:07:42,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:42,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 105 treesize of output 128 [2024-11-22 13:07:43,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:43,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 120 treesize of output 122 [2024-11-22 13:07:43,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:43,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 109 [2024-11-22 13:07:44,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:44,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 113 treesize of output 107 [2024-11-22 13:07:44,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:44,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 121 treesize of output 123 [2024-11-22 13:07:44,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:44,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 127 treesize of output 138 [2024-11-22 13:07:44,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:44,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 142 treesize of output 152 [2024-11-22 13:07:44,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:44,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 179 treesize of output 85 [2024-11-22 13:07:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 32 proven. 672 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-22 13:07:45,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:07:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:07:45,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:07:45,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182577034] [2024-11-22 13:07:45,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182577034] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:07:45,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:07:45,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2024-11-22 13:07:45,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798684957] [2024-11-22 13:07:45,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:45,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:07:45,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:07:45,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:07:45,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-11-22 13:07:45,330 INFO L87 Difference]: Start difference. First operand 264 states and 370 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:07:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:47,198 INFO L93 Difference]: Finished difference Result 684 states and 952 transitions. [2024-11-22 13:07:47,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:07:47,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-22 13:07:47,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:47,202 INFO L225 Difference]: With dead ends: 684 [2024-11-22 13:07:47,202 INFO L226 Difference]: Without dead ends: 476 [2024-11-22 13:07:47,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2024-11-22 13:07:47,203 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 132 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:47,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 895 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-22 13:07:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-22 13:07:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 471. [2024-11-22 13:07:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 382 states have (on average 1.301047120418848) internal successors, (497), 385 states have internal predecessors, (497), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-22 13:07:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 657 transitions. [2024-11-22 13:07:47,230 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 657 transitions. Word has length 169 [2024-11-22 13:07:47,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:47,230 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 657 transitions. [2024-11-22 13:07:47,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:07:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 657 transitions. [2024-11-22 13:07:47,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-22 13:07:47,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:47,232 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:47,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-22 13:07:47,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:47,436 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:47,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:47,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1554554881, now seen corresponding path program 1 times [2024-11-22 13:07:47,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:07:47,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526341227] [2024-11-22 13:07:47,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:47,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:47,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:07:47,439 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:07:47,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 13:07:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:47,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 13:07:47,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:07:48,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:48,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2024-11-22 13:07:48,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:48,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 100 [2024-11-22 13:07:48,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:48,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 105 treesize of output 113 [2024-11-22 13:07:48,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:48,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 120 treesize of output 127 [2024-11-22 13:07:48,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:48,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 126 treesize of output 46 [2024-11-22 13:07:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-22 13:07:48,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:07:48,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:07:48,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526341227] [2024-11-22 13:07:48,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526341227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:48,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:07:48,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 13:07:48,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662629516] [2024-11-22 13:07:48,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:48,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 13:07:48,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:07:48,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 13:07:48,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:07:48,491 INFO L87 Difference]: Start difference. First operand 471 states and 657 transitions. Second operand has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:54,929 INFO L93 Difference]: Finished difference Result 989 states and 1366 transitions. [2024-11-22 13:07:54,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-22 13:07:54,933 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-22 13:07:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:54,936 INFO L225 Difference]: With dead ends: 989 [2024-11-22 13:07:54,936 INFO L226 Difference]: Without dead ends: 574 [2024-11-22 13:07:54,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2024-11-22 13:07:54,938 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 514 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:54,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 624 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-22 13:07:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-22 13:07:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 471. [2024-11-22 13:07:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 382 states have (on average 1.2905759162303665) internal successors, (493), 385 states have internal predecessors, (493), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-22 13:07:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 653 transitions. [2024-11-22 13:07:54,976 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 653 transitions. Word has length 169 [2024-11-22 13:07:54,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:54,977 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 653 transitions. [2024-11-22 13:07:54,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:07:54,977 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 653 transitions. [2024-11-22 13:07:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-22 13:07:54,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:54,978 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:54,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-22 13:07:55,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:55,179 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:55,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:55,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1719344061, now seen corresponding path program 1 times [2024-11-22 13:07:55,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:07:55,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785618072] [2024-11-22 13:07:55,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:55,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:55,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:07:55,181 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:07:55,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 13:07:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:55,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 13:07:55,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:07:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:07:55,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:07:55,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:07:55,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785618072] [2024-11-22 13:07:55,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785618072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:55,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:07:55,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:07:55,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592815228] [2024-11-22 13:07:55,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:55,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:07:55,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:07:55,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:07:55,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:07:55,544 INFO L87 Difference]: Start difference. First operand 471 states and 653 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:07:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:07:55,587 INFO L93 Difference]: Finished difference Result 886 states and 1226 transitions. [2024-11-22 13:07:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:07:55,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-22 13:07:55,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:07:55,589 INFO L225 Difference]: With dead ends: 886 [2024-11-22 13:07:55,589 INFO L226 Difference]: Without dead ends: 471 [2024-11-22 13:07:55,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:07:55,590 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:07:55,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:07:55,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-22 13:07:55,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 467. [2024-11-22 13:07:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 378 states have (on average 1.2883597883597884) internal successors, (487), 381 states have internal predecessors, (487), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-22 13:07:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 647 transitions. [2024-11-22 13:07:55,629 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 647 transitions. Word has length 169 [2024-11-22 13:07:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:07:55,631 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 647 transitions. [2024-11-22 13:07:55,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:07:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 647 transitions. [2024-11-22 13:07:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-22 13:07:55,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:07:55,632 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:07:55,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-22 13:07:55,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:55,836 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:07:55,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:07:55,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1591474460, now seen corresponding path program 1 times [2024-11-22 13:07:55,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:07:55,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697052494] [2024-11-22 13:07:55,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:07:55,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:07:55,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:07:55,838 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:07:55,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-22 13:07:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:07:56,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 13:07:56,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:07:56,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:56,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2024-11-22 13:07:56,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:56,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 100 [2024-11-22 13:07:56,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:07:56,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 95 treesize of output 35 [2024-11-22 13:07:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-22 13:07:56,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:07:56,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:07:56,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697052494] [2024-11-22 13:07:56,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697052494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:07:56,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:07:56,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 13:07:56,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973131779] [2024-11-22 13:07:56,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:07:56,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:07:56,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:07:56,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:07:56,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:07:56,552 INFO L87 Difference]: Start difference. First operand 467 states and 647 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:08:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:08:01,098 INFO L93 Difference]: Finished difference Result 893 states and 1226 transitions. [2024-11-22 13:08:01,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 13:08:01,099 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-22 13:08:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:08:01,104 INFO L225 Difference]: With dead ends: 893 [2024-11-22 13:08:01,104 INFO L226 Difference]: Without dead ends: 482 [2024-11-22 13:08:01,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-22 13:08:01,108 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 340 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:08:01,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 509 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-22 13:08:01,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-22 13:08:01,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 467. [2024-11-22 13:08:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 378 states have (on average 1.2777777777777777) internal successors, (483), 381 states have internal predecessors, (483), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-22 13:08:01,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 643 transitions. [2024-11-22 13:08:01,158 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 643 transitions. Word has length 169 [2024-11-22 13:08:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:08:01,160 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 643 transitions. [2024-11-22 13:08:01,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:08:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 643 transitions. [2024-11-22 13:08:01,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-22 13:08:01,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:08:01,162 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:08:01,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-22 13:08:01,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:08:01,364 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:08:01,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:08:01,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1168772634, now seen corresponding path program 1 times [2024-11-22 13:08:01,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:08:01,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011790237] [2024-11-22 13:08:01,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:08:01,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:08:01,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:08:01,370 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:08:01,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-22 13:08:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:08:01,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-22 13:08:01,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:08:01,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 13:08:01,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 13:08:02,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-22 13:08:02,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-22 13:08:02,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-22 13:08:02,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2024-11-22 13:08:02,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:08:02,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 57 [2024-11-22 13:08:02,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:08:02,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 70 [2024-11-22 13:08:03,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:08:03,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 73 [2024-11-22 13:08:03,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:08:03,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 73 [2024-11-22 13:08:03,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:08:03,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 83 [2024-11-22 13:08:04,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:08:04,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 120 treesize of output 86 [2024-11-22 13:08:04,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:08:04,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 133 treesize of output 97 [2024-11-22 13:08:04,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:08:04,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 161 treesize of output 148 [2024-11-22 13:08:08,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:08:08,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 258 treesize of output 206 [2024-11-22 13:08:11,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:08:11,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 333 treesize of output 125 [2024-11-22 13:08:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 628 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-22 13:08:16,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:08:16,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:08:16,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011790237] [2024-11-22 13:08:16,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011790237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:08:16,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:08:16,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-22 13:08:16,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260867342] [2024-11-22 13:08:16,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:08:16,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 13:08:16,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:08:16,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 13:08:16,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2024-11-22 13:08:16,491 INFO L87 Difference]: Start difference. First operand 467 states and 643 transitions. Second operand has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 18 states have internal predecessors, (87), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20)