./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.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 b6271bd0a37fb423024bed9c2fae52ec13738291896513228b822cdc7afdfa85 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:08:23,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:08:23,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:08:23,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:08:23,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:08:23,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:08:23,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:08:23,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:08:23,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:08:23,464 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:08:23,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:08:23,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:08:23,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:08:23,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:08:23,468 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:08:23,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:08:23,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:08:23,469 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:08:23,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:08:23,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:08:23,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:08:23,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:08:23,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:08:23,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:08:23,471 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:08:23,471 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:08:23,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:08:23,472 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:08:23,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:08:23,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:08:23,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:08:23,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:08:23,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:08:23,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:08:23,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:08:23,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:08:23,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:08:23,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:08:23,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:08:23,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:08:23,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:08:23,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:08:23,476 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 -> b6271bd0a37fb423024bed9c2fae52ec13738291896513228b822cdc7afdfa85 [2024-11-19 01:08:23,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:08:23,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:08:23,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:08:23,751 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:08:23,752 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:08:23,753 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-54.i [2024-11-19 01:08:25,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:08:25,372 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:08:25,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i [2024-11-19 01:08:25,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5308f87/808837dfb93c4d5bb0b1e211ce019317/FLAG53540a2aa [2024-11-19 01:08:25,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5308f87/808837dfb93c4d5bb0b1e211ce019317 [2024-11-19 01:08:25,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:08:25,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:08:25,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:08:25,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:08:25,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:08:25,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:08:25" (1/1) ... [2024-11-19 01:08:25,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a14c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:25, skipping insertion in model container [2024-11-19 01:08:25,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:08:25" (1/1) ... [2024-11-19 01:08:25,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:08:25,655 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-54.i[916,929] [2024-11-19 01:08:25,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:08:25,719 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:08:25,729 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-54.i[916,929] [2024-11-19 01:08:25,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:08:25,792 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:08:25,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:25 WrapperNode [2024-11-19 01:08:25,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:08:25,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:08:25,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:08:25,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:08:25,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:25" (1/1) ... [2024-11-19 01:08:25,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:25" (1/1) ... [2024-11-19 01:08:25,850 INFO L138 Inliner]: procedures = 30, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2024-11-19 01:08:25,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:08:25,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:08:25,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:08:25,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:08:25,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:25" (1/1) ... [2024-11-19 01:08:25,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:25" (1/1) ... [2024-11-19 01:08:25,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:25" (1/1) ... [2024-11-19 01:08:25,892 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-19 01:08:25,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:25" (1/1) ... [2024-11-19 01:08:25,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:25" (1/1) ... [2024-11-19 01:08:25,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:25" (1/1) ... [2024-11-19 01:08:25,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:25" (1/1) ... [2024-11-19 01:08:25,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:25" (1/1) ... [2024-11-19 01:08:25,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:25" (1/1) ... [2024-11-19 01:08:25,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:08:25,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:08:25,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:08:25,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:08:25,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:25" (1/1) ... [2024-11-19 01:08:25,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:08:25,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:08:26,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:08:26,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:08:26,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:08:26,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-19 01:08:26,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-19 01:08:26,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 01:08:26,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-19 01:08:26,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-19 01:08:26,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 01:08:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:08:26,075 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:08:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 01:08:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:08:26,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:08:26,217 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:08:26,219 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:08:26,735 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-19 01:08:26,735 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:08:26,759 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:08:26,759 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:08:26,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:08:26 BoogieIcfgContainer [2024-11-19 01:08:26,760 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:08:26,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:08:26,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:08:26,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:08:26,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:08:25" (1/3) ... [2024-11-19 01:08:26,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a8ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:08:26, skipping insertion in model container [2024-11-19 01:08:26,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:25" (2/3) ... [2024-11-19 01:08:26,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a8ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:08:26, skipping insertion in model container [2024-11-19 01:08:26,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:08:26" (3/3) ... [2024-11-19 01:08:26,770 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-54.i [2024-11-19 01:08:26,783 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:08:26,784 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:08:26,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:08:26,848 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;@f5e8770, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:08:26,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:08:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:08:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 01:08:26,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:26,863 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:26,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:26,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:26,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1606318882, now seen corresponding path program 1 times [2024-11-19 01:08:26,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:26,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056052388] [2024-11-19 01:08:26,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:26,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-19 01:08:27,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:08:27,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056052388] [2024-11-19 01:08:27,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056052388] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:08:27,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599374494] [2024-11-19 01:08:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:27,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:08:27,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:08:27,260 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:08:27,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 01:08:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:27,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:08:27,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-19 01:08:27,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:27,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599374494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:27,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:08:27,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:08:27,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430831583] [2024-11-19 01:08:27,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:27,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:08:27,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:08:27,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:08:27,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:08:27,521 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:08:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:27,550 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-11-19 01:08:27,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:08:27,554 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-19 01:08:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:27,564 INFO L225 Difference]: With dead ends: 213 [2024-11-19 01:08:27,564 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 01:08:27,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 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-19 01:08:27,570 INFO L432 NwaCegarLoop]: 155 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, 155 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-19 01:08:27,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:08:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 01:08:27,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-19 01:08:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:08:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-19 01:08:27,609 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2024-11-19 01:08:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:27,609 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-19 01:08:27,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:08:27,610 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-19 01:08:27,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 01:08:27,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:27,614 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:27,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 01:08:27,815 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-19 01:08:27,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:27,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:27,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1914200370, now seen corresponding path program 1 times [2024-11-19 01:08:27,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:27,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721882161] [2024-11-19 01:08:27,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:27,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 01:08:28,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:08:28,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721882161] [2024-11-19 01:08:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721882161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:08:28,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160625270] [2024-11-19 01:08:28,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:28,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:08:28,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:08:28,378 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:08:28,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 01:08:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:28,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:08:28,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:08:28,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:28,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160625270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:28,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:08:28,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 01:08:28,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340519155] [2024-11-19 01:08:28,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:28,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:08:28,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:08:28,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:08:28,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:08:28,645 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:28,694 INFO L93 Difference]: Finished difference Result 212 states and 311 transitions. [2024-11-19 01:08:28,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:08:28,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-19 01:08:28,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:28,697 INFO L225 Difference]: With dead ends: 212 [2024-11-19 01:08:28,697 INFO L226 Difference]: Without dead ends: 109 [2024-11-19 01:08:28,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:08:28,699 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 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-19 01:08:28,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:08:28,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-19 01:08:28,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-19 01:08:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:08:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-19 01:08:28,712 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2024-11-19 01:08:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:28,714 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-19 01:08:28,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-19 01:08:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 01:08:28,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:28,718 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:28,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 01:08:28,919 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,SelfDestructingSolverStorable1 [2024-11-19 01:08:28,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:28,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash -139193008, now seen corresponding path program 1 times [2024-11-19 01:08:28,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:28,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88370488] [2024-11-19 01:08:28,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:28,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 01:08:29,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:08:29,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88370488] [2024-11-19 01:08:29,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88370488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:08:29,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723548932] [2024-11-19 01:08:29,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:29,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:08:29,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:08:29,128 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:08:29,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 01:08:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:29,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:08:29,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:08:29,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:29,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723548932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:29,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:08:29,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 01:08:29,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378330972] [2024-11-19 01:08:29,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:29,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:08:29,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:08:29,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:08:29,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:08:29,372 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:29,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:29,410 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2024-11-19 01:08:29,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:08:29,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-19 01:08:29,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:29,414 INFO L225 Difference]: With dead ends: 216 [2024-11-19 01:08:29,418 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 01:08:29,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:08:29,420 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 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-19 01:08:29,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:08:29,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 01:08:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-19 01:08:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:08:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-19 01:08:29,431 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 105 [2024-11-19 01:08:29,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:29,432 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-19 01:08:29,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-19 01:08:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 01:08:29,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:29,437 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:29,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 01:08:29,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:08:29,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:29,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:29,639 INFO L85 PathProgramCache]: Analyzing trace with hash -137345966, now seen corresponding path program 1 times [2024-11-19 01:08:29,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:29,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521238225] [2024-11-19 01:08:29,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:29,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 01:08:29,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:08:29,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521238225] [2024-11-19 01:08:29,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521238225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:08:29,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532605809] [2024-11-19 01:08:29,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:29,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:08:29,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:08:29,873 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:08:29,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 01:08:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:30,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:08:30,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:08:30,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:30,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532605809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:30,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:08:30,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-19 01:08:30,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245985509] [2024-11-19 01:08:30,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:30,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:08:30,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:08:30,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:08:30,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:08:30,102 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:30,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:30,133 INFO L93 Difference]: Finished difference Result 219 states and 318 transitions. [2024-11-19 01:08:30,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:08:30,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-19 01:08:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:30,135 INFO L225 Difference]: With dead ends: 219 [2024-11-19 01:08:30,135 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 01:08:30,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:08:30,137 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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-19 01:08:30,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:08:30,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 01:08:30,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-19 01:08:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:08:30,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-19 01:08:30,155 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 105 [2024-11-19 01:08:30,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:30,156 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-19 01:08:30,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:30,156 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-19 01:08:30,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 01:08:30,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:30,157 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:30,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 01:08:30,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:08:30,359 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:30,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:30,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1462081101, now seen corresponding path program 1 times [2024-11-19 01:08:30,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:30,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175470245] [2024-11-19 01:08:30,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:30,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:30,985 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:08:30,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:08:30,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175470245] [2024-11-19 01:08:30,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175470245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:30,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:30,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:08:30,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62882621] [2024-11-19 01:08:30,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:30,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:08:30,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:08:30,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:08:30,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:08:30,991 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:31,381 INFO L93 Difference]: Finished difference Result 323 states and 466 transitions. [2024-11-19 01:08:31,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:08:31,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-19 01:08:31,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:31,384 INFO L225 Difference]: With dead ends: 323 [2024-11-19 01:08:31,384 INFO L226 Difference]: Without dead ends: 214 [2024-11-19 01:08:31,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:08:31,386 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 125 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:31,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 302 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:08:31,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-19 01:08:31,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 133. [2024-11-19 01:08:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 119 states have internal predecessors, (170), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:08:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2024-11-19 01:08:31,396 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 107 [2024-11-19 01:08:31,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:31,397 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2024-11-19 01:08:31,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2024-11-19 01:08:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 01:08:31,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:31,398 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:31,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:08:31,399 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:31,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:31,399 INFO L85 PathProgramCache]: Analyzing trace with hash 544621908, now seen corresponding path program 1 times [2024-11-19 01:08:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:31,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789767501] [2024-11-19 01:08:31,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:31,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:08:32,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:08:32,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789767501] [2024-11-19 01:08:32,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789767501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:32,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:32,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:08:32,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337593473] [2024-11-19 01:08:32,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:32,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:08:32,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:08:32,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:08:32,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:08:32,742 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:32,978 INFO L93 Difference]: Finished difference Result 368 states and 536 transitions. [2024-11-19 01:08:32,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:08:32,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-19 01:08:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:32,981 INFO L225 Difference]: With dead ends: 368 [2024-11-19 01:08:32,981 INFO L226 Difference]: Without dead ends: 238 [2024-11-19 01:08:32,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:08:32,985 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 103 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:32,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 249 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:08:32,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-19 01:08:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-19 01:08:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 207 states have internal predecessors, (292), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 01:08:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 340 transitions. [2024-11-19 01:08:33,007 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 340 transitions. Word has length 108 [2024-11-19 01:08:33,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:33,008 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 340 transitions. [2024-11-19 01:08:33,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 340 transitions. [2024-11-19 01:08:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 01:08:33,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:33,010 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:33,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:08:33,010 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:33,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:33,010 INFO L85 PathProgramCache]: Analyzing trace with hash -273026542, now seen corresponding path program 1 times [2024-11-19 01:08:33,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:33,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337526939] [2024-11-19 01:08:33,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:33,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:34,235 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:08:34,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:08:34,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337526939] [2024-11-19 01:08:34,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337526939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:34,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:34,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:08:34,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256533145] [2024-11-19 01:08:34,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:34,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:08:34,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:08:34,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:08:34,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:08:34,237 INFO L87 Difference]: Start difference. First operand 234 states and 340 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:34,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:34,594 INFO L93 Difference]: Finished difference Result 469 states and 681 transitions. [2024-11-19 01:08:34,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:08:34,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-19 01:08:34,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:34,597 INFO L225 Difference]: With dead ends: 469 [2024-11-19 01:08:34,597 INFO L226 Difference]: Without dead ends: 238 [2024-11-19 01:08:34,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:08:34,598 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 96 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:34,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 300 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:08:34,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-19 01:08:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-19 01:08:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.4057971014492754) internal successors, (291), 207 states have internal predecessors, (291), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 01:08:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 339 transitions. [2024-11-19 01:08:34,616 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 339 transitions. Word has length 108 [2024-11-19 01:08:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:34,616 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 339 transitions. [2024-11-19 01:08:34,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 339 transitions. [2024-11-19 01:08:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 01:08:34,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:34,618 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:34,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:08:34,619 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:34,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:34,619 INFO L85 PathProgramCache]: Analyzing trace with hash -859832556, now seen corresponding path program 1 times [2024-11-19 01:08:34,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:34,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112069657] [2024-11-19 01:08:34,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:34,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:08:35,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:08:35,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112069657] [2024-11-19 01:08:35,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112069657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:35,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:35,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:08:35,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235378998] [2024-11-19 01:08:35,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:35,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:08:35,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:08:35,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:08:35,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:08:35,821 INFO L87 Difference]: Start difference. First operand 234 states and 339 transitions. Second operand has 8 states, 6 states have (on average 8.5) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:08:36,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:36,287 INFO L93 Difference]: Finished difference Result 595 states and 850 transitions. [2024-11-19 01:08:36,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:08:36,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.5) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-19 01:08:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:36,291 INFO L225 Difference]: With dead ends: 595 [2024-11-19 01:08:36,291 INFO L226 Difference]: Without dead ends: 364 [2024-11-19 01:08:36,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:08:36,293 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 77 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:36,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 664 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:08:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-19 01:08:36,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 360. [2024-11-19 01:08:36,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 319 states have (on average 1.3699059561128526) internal successors, (437), 321 states have internal predecessors, (437), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:08:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 509 transitions. [2024-11-19 01:08:36,318 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 509 transitions. Word has length 108 [2024-11-19 01:08:36,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:36,320 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 509 transitions. [2024-11-19 01:08:36,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.5) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:08:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 509 transitions. [2024-11-19 01:08:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 01:08:36,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:36,322 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:36,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:08:36,323 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:36,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:36,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1112397672, now seen corresponding path program 1 times [2024-11-19 01:08:36,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:36,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468607596] [2024-11-19 01:08:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:36,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:08:37,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:08:37,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468607596] [2024-11-19 01:08:37,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468607596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:37,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:37,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 01:08:37,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267934687] [2024-11-19 01:08:37,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:37,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:08:37,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:08:37,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:08:37,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:08:37,209 INFO L87 Difference]: Start difference. First operand 360 states and 509 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:38,167 INFO L93 Difference]: Finished difference Result 760 states and 1081 transitions. [2024-11-19 01:08:38,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 01:08:38,167 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-19 01:08:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:38,173 INFO L225 Difference]: With dead ends: 760 [2024-11-19 01:08:38,174 INFO L226 Difference]: Without dead ends: 564 [2024-11-19 01:08:38,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-19 01:08:38,176 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 134 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:38,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1376 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:08:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-11-19 01:08:38,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 388. [2024-11-19 01:08:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 347 states have (on average 1.3861671469740633) internal successors, (481), 349 states have internal predecessors, (481), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:08:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 553 transitions. [2024-11-19 01:08:38,204 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 553 transitions. Word has length 109 [2024-11-19 01:08:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:38,205 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 553 transitions. [2024-11-19 01:08:38,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 553 transitions. [2024-11-19 01:08:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 01:08:38,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:38,207 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:38,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:08:38,208 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:38,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:38,208 INFO L85 PathProgramCache]: Analyzing trace with hash 101280422, now seen corresponding path program 1 times [2024-11-19 01:08:38,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:38,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514674569] [2024-11-19 01:08:38,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:39,162 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:08:39,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:08:39,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514674569] [2024-11-19 01:08:39,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514674569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:39,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:39,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:08:39,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144640775] [2024-11-19 01:08:39,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:39,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:08:39,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:08:39,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:08:39,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:08:39,164 INFO L87 Difference]: Start difference. First operand 388 states and 553 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:08:39,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:39,506 INFO L93 Difference]: Finished difference Result 697 states and 994 transitions. [2024-11-19 01:08:39,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:08:39,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-19 01:08:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:39,509 INFO L225 Difference]: With dead ends: 697 [2024-11-19 01:08:39,509 INFO L226 Difference]: Without dead ends: 473 [2024-11-19 01:08:39,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:08:39,511 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 152 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:39,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 555 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:08:39,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-19 01:08:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 388. [2024-11-19 01:08:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 347 states have (on average 1.3804034582132565) internal successors, (479), 349 states have internal predecessors, (479), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:08:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 551 transitions. [2024-11-19 01:08:39,535 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 551 transitions. Word has length 109 [2024-11-19 01:08:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:39,535 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 551 transitions. [2024-11-19 01:08:39,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:08:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 551 transitions. [2024-11-19 01:08:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 01:08:39,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:39,539 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:39,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:08:39,539 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:39,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:39,540 INFO L85 PathProgramCache]: Analyzing trace with hash 978384166, now seen corresponding path program 1 times [2024-11-19 01:08:39,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:39,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621932428] [2024-11-19 01:08:39,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:39,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:08:40,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:08:40,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621932428] [2024-11-19 01:08:40,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621932428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:40,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:40,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:08:40,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030586698] [2024-11-19 01:08:40,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:40,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:08:40,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:08:40,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:08:40,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:08:40,379 INFO L87 Difference]: Start difference. First operand 388 states and 551 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:08:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:40,837 INFO L93 Difference]: Finished difference Result 699 states and 992 transitions. [2024-11-19 01:08:40,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:08:40,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-19 01:08:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:40,841 INFO L225 Difference]: With dead ends: 699 [2024-11-19 01:08:40,841 INFO L226 Difference]: Without dead ends: 475 [2024-11-19 01:08:40,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:08:40,842 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 79 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:40,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 630 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:08:40,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-19 01:08:40,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 388. [2024-11-19 01:08:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 347 states have (on average 1.3746397694524495) internal successors, (477), 349 states have internal predecessors, (477), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:08:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 549 transitions. [2024-11-19 01:08:40,868 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 549 transitions. Word has length 109 [2024-11-19 01:08:40,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:40,869 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 549 transitions. [2024-11-19 01:08:40,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:08:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 549 transitions. [2024-11-19 01:08:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 01:08:40,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:40,871 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:40,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 01:08:40,871 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:40,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:40,872 INFO L85 PathProgramCache]: Analyzing trace with hash -32733084, now seen corresponding path program 1 times [2024-11-19 01:08:40,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:40,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42942767] [2024-11-19 01:08:40,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:40,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:08:41,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:08:41,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42942767] [2024-11-19 01:08:41,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42942767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:41,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:41,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:08:41,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848136843] [2024-11-19 01:08:41,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:41,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:08:41,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:08:41,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:08:41,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:08:41,281 INFO L87 Difference]: Start difference. First operand 388 states and 549 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:41,724 INFO L93 Difference]: Finished difference Result 782 states and 1107 transitions. [2024-11-19 01:08:41,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 01:08:41,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-19 01:08:41,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:41,728 INFO L225 Difference]: With dead ends: 782 [2024-11-19 01:08:41,728 INFO L226 Difference]: Without dead ends: 558 [2024-11-19 01:08:41,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:08:41,730 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 129 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:41,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1188 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:08:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-11-19 01:08:41,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 382. [2024-11-19 01:08:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 341 states have (on average 1.3753665689149561) internal successors, (469), 343 states have internal predecessors, (469), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:08:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 541 transitions. [2024-11-19 01:08:41,753 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 541 transitions. Word has length 109 [2024-11-19 01:08:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:41,754 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 541 transitions. [2024-11-19 01:08:41,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:41,755 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 541 transitions. [2024-11-19 01:08:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 01:08:41,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:41,758 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:41,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 01:08:41,758 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:41,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:41,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1438926694, now seen corresponding path program 1 times [2024-11-19 01:08:41,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:41,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771050464] [2024-11-19 01:08:41,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:41,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:08:42,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:08:42,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771050464] [2024-11-19 01:08:42,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771050464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:42,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:42,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:08:42,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51165048] [2024-11-19 01:08:42,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:42,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:08:42,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:08:42,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:08:42,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:08:42,055 INFO L87 Difference]: Start difference. First operand 382 states and 541 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:42,351 INFO L93 Difference]: Finished difference Result 440 states and 615 transitions. [2024-11-19 01:08:42,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:08:42,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-19 01:08:42,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:42,354 INFO L225 Difference]: With dead ends: 440 [2024-11-19 01:08:42,354 INFO L226 Difference]: Without dead ends: 438 [2024-11-19 01:08:42,355 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-19 01:08:42,356 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 113 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:42,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 565 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:08:42,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-19 01:08:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 437. [2024-11-19 01:08:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 383 states have (on average 1.349869451697128) internal successors, (517), 386 states have internal predecessors, (517), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-19 01:08:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 609 transitions. [2024-11-19 01:08:42,379 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 609 transitions. Word has length 110 [2024-11-19 01:08:42,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:42,380 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 609 transitions. [2024-11-19 01:08:42,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:42,380 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 609 transitions. [2024-11-19 01:08:42,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 01:08:42,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:42,381 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:42,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 01:08:42,382 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:42,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:42,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1440773736, now seen corresponding path program 1 times [2024-11-19 01:08:42,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:42,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519320816] [2024-11-19 01:08:42,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:42,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:08:42,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:08:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:08:42,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:08:42,615 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:08:42,616 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:08:42,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 01:08:42,622 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:08:42,687 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:08:42,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:08:42 BoogieIcfgContainer [2024-11-19 01:08:42,691 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:08:42,692 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:08:42,692 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:08:42,692 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:08:42,693 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:08:26" (3/4) ... [2024-11-19 01:08:42,696 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:08:42,697 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:08:42,698 INFO L158 Benchmark]: Toolchain (without parser) took 17296.78ms. Allocated memory was 151.0MB in the beginning and 545.3MB in the end (delta: 394.3MB). Free memory was 97.0MB in the beginning and 466.3MB in the end (delta: -369.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-11-19 01:08:42,698 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:08:42,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.51ms. Allocated memory is still 151.0MB. Free memory was 97.0MB in the beginning and 115.1MB in the end (delta: -18.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 01:08:42,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.08ms. Allocated memory is still 151.0MB. Free memory was 115.1MB in the beginning and 111.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:08:42,699 INFO L158 Benchmark]: Boogie Preprocessor took 92.92ms. Allocated memory is still 151.0MB. Free memory was 111.6MB in the beginning and 107.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:08:42,699 INFO L158 Benchmark]: RCFGBuilder took 811.11ms. Allocated memory is still 151.0MB. Free memory was 107.4MB in the beginning and 75.3MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-19 01:08:42,700 INFO L158 Benchmark]: TraceAbstraction took 15928.18ms. Allocated memory was 151.0MB in the beginning and 545.3MB in the end (delta: 394.3MB). Free memory was 74.5MB in the beginning and 467.4MB in the end (delta: -392.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:08:42,700 INFO L158 Benchmark]: Witness Printer took 5.31ms. Allocated memory is still 545.3MB. Free memory was 467.4MB in the beginning and 466.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:08:42,701 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.18ms. Allocated memory is still 92.3MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.51ms. Allocated memory is still 151.0MB. Free memory was 97.0MB in the beginning and 115.1MB in the end (delta: -18.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.08ms. Allocated memory is still 151.0MB. Free memory was 115.1MB in the beginning and 111.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.92ms. Allocated memory is still 151.0MB. Free memory was 111.6MB in the beginning and 107.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 811.11ms. Allocated memory is still 151.0MB. Free memory was 107.4MB in the beginning and 75.3MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15928.18ms. Allocated memory was 151.0MB in the beginning and 545.3MB in the end (delta: 394.3MB). Free memory was 74.5MB in the beginning and 467.4MB in the end (delta: -392.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Witness Printer took 5.31ms. Allocated memory is still 545.3MB. Free memory was 467.4MB in the beginning and 466.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 109. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] FCALL updateLastVariables() [L117] CALL updateVariables() [L86] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L90] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] 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] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] 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] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) 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_10 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_12 [L99] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_12 [L99] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 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] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 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] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) 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_16 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] RET updateVariables() [L118] CALL step() [L54] EXPR WrapperStruct00.var_1_12 [L54] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_12 [L55] EXPR WrapperStruct00.var_1_16 [L55] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L56] signed long int stepLocal_0 = -4; [L57] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=-4] [L57] COND FALSE !(stepLocal_0 >= WrapperStruct00.var_1_15) [L60] EXPR WrapperStruct00.var_1_3 [L60] unsigned char stepLocal_2 = WrapperStruct00.var_1_3; [L61] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_2=7] [L61] COND FALSE !(WrapperStruct00.var_1_9) [L70] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_2=7] [L70] EXPR ((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1) [L70] EXPR WrapperStruct00.var_1_1 [L70] EXPR ((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_2=7] [L70] signed long int stepLocal_1 = (((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)); [L71] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=16, stepLocal_2=7] [L71] COND FALSE !((8 * WrapperStruct00.var_1_1) == stepLocal_1) [L82] EXPR WrapperStruct00.var_1_10 [L82] WrapperStruct00.var_1_4 = WrapperStruct00.var_1_10 [L118] RET step() [L119] CALL, EXPR property() [L109] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10))) [L109] EXPR WrapperStruct00.var_1_1 [L109] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1) [L109] EXPR WrapperStruct00.var_1_1 [L109] EXPR ((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)) [L109] EXPR WrapperStruct00.var_1_4 [L109] EXPR WrapperStruct00.var_1_10 [L109] EXPR ((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10))) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1) [L109] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1)) && (WrapperStruct00.var_1_14 == ((float) WrapperStruct00.var_1_12)) [L109] EXPR WrapperStruct00.var_1_14 [L109] EXPR WrapperStruct00.var_1_12 [L109] EXPR ((((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1)) && (WrapperStruct00.var_1_14 == ((float) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1)) && (WrapperStruct00.var_1_14 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109-L110] return (((((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1)) && (WrapperStruct00.var_1_14 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16)) ; [L119] RET, EXPR property() [L119] 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, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.8s, OverallIterations: 14, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1014 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1010 mSDsluCounter, 7325 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5413 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3798 IncrementalHoareTripleChecker+Invalid, 3884 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 1912 mSDtfsCounter, 3798 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 579 GetRequests, 498 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=437occurred in iteration=13, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 620 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 1927 NumberOfCodeBlocks, 1927 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1800 ConstructedInterpolants, 0 QuantifiedInterpolants, 3461 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1539 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 4367/4488 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-19 01:08:42,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.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 b6271bd0a37fb423024bed9c2fae52ec13738291896513228b822cdc7afdfa85 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:08:44,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:08:45,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:08:45,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:08:45,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:08:45,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:08:45,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:08:45,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:08:45,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:08:45,057 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:08:45,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:08:45,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:08:45,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:08:45,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:08:45,060 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:08:45,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:08:45,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:08:45,064 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:08:45,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:08:45,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:08:45,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:08:45,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:08:45,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:08:45,067 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:08:45,067 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:08:45,067 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:08:45,067 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:08:45,068 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:08:45,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:08:45,068 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:08:45,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:08:45,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:08:45,069 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:08:45,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:08:45,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:08:45,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:08:45,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:08:45,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:08:45,071 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:08:45,072 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:08:45,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:08:45,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:08:45,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:08:45,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:08:45,072 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 -> b6271bd0a37fb423024bed9c2fae52ec13738291896513228b822cdc7afdfa85 [2024-11-19 01:08:45,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:08:45,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:08:45,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:08:45,430 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:08:45,430 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:08:45,432 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-54.i [2024-11-19 01:08:46,926 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:08:47,149 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:08:47,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i [2024-11-19 01:08:47,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/892ca8d76/d9814eeea1754e5aba65daf41650802f/FLAG646241b45 [2024-11-19 01:08:47,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/892ca8d76/d9814eeea1754e5aba65daf41650802f [2024-11-19 01:08:47,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:08:47,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:08:47,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:08:47,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:08:47,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:08:47,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:08:47" (1/1) ... [2024-11-19 01:08:47,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cc42ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:47, skipping insertion in model container [2024-11-19 01:08:47,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:08:47" (1/1) ... [2024-11-19 01:08:47,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:08:47,733 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-54.i[916,929] [2024-11-19 01:08:47,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:08:47,819 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:08:47,832 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-54.i[916,929] [2024-11-19 01:08:47,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:08:47,910 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:08:47,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:47 WrapperNode [2024-11-19 01:08:47,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:08:47,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:08:47,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:08:47,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:08:47,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:47" (1/1) ... [2024-11-19 01:08:47,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:47" (1/1) ... [2024-11-19 01:08:47,987 INFO L138 Inliner]: procedures = 34, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462 [2024-11-19 01:08:47,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:08:47,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:08:47,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:08:47,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:08:48,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:47" (1/1) ... [2024-11-19 01:08:48,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:47" (1/1) ... [2024-11-19 01:08:48,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:47" (1/1) ... [2024-11-19 01:08:48,057 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2024-11-19 01:08:48,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:47" (1/1) ... [2024-11-19 01:08:48,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:47" (1/1) ... [2024-11-19 01:08:48,085 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:47" (1/1) ... [2024-11-19 01:08:48,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:47" (1/1) ... [2024-11-19 01:08:48,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:47" (1/1) ... [2024-11-19 01:08:48,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:47" (1/1) ... [2024-11-19 01:08:48,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:08:48,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:08:48,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:08:48,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:08:48,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:47" (1/1) ... [2024-11-19 01:08:48,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:08:48,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:08:48,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:08:48,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:08:48,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:08:48,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 01:08:48,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 01:08:48,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-19 01:08:48,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-19 01:08:48,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 01:08:48,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 01:08:48,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:08:48,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:08:48,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:08:48,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:08:48,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 01:08:48,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 01:08:48,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 01:08:48,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 01:08:48,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-19 01:08:48,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-19 01:08:48,205 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:08:48,205 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:08:48,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-19 01:08:48,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-19 01:08:48,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:08:48,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:08:48,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:08:48,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:08:48,350 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:08:48,352 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:08:50,037 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-19 01:08:50,037 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:08:50,055 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:08:50,055 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:08:50,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:08:50 BoogieIcfgContainer [2024-11-19 01:08:50,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:08:50,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:08:50,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:08:50,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:08:50,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:08:47" (1/3) ... [2024-11-19 01:08:50,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8f1930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:08:50, skipping insertion in model container [2024-11-19 01:08:50,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:47" (2/3) ... [2024-11-19 01:08:50,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8f1930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:08:50, skipping insertion in model container [2024-11-19 01:08:50,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:08:50" (3/3) ... [2024-11-19 01:08:50,064 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-54.i [2024-11-19 01:08:50,076 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:08:50,077 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:08:50,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:08:50,143 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;@755c7925, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:08:50,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:08:50,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:08:50,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 01:08:50,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:50,166 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:50,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:50,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2063923592, now seen corresponding path program 1 times [2024-11-19 01:08:50,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:50,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232645153] [2024-11-19 01:08:50,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:50,188 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-19 01:08:50,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:50,191 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-19 01:08:50,193 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-19 01:08:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:50,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:08:50,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-19 01:08:50,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:50,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:50,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232645153] [2024-11-19 01:08:50,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232645153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:50,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:50,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:08:50,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895173056] [2024-11-19 01:08:50,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:50,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:08:50,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:50,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:08:50,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:08:50,605 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:08:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:50,631 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-11-19 01:08:50,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:08:50,634 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-19 01:08:50,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:50,640 INFO L225 Difference]: With dead ends: 213 [2024-11-19 01:08:50,641 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 01:08:50,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-19 01:08:50,647 INFO L432 NwaCegarLoop]: 155 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, 155 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-19 01:08:50,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:08:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 01:08:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-19 01:08:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:08:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-19 01:08:50,683 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2024-11-19 01:08:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:50,683 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-19 01:08:50,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:08:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-19 01:08:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 01:08:50,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:50,686 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:50,696 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-19 01:08:50,887 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-19 01:08:50,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:50,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:50,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1289475548, now seen corresponding path program 1 times [2024-11-19 01:08:50,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:50,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107038204] [2024-11-19 01:08:50,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:50,890 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-19 01:08:50,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:50,893 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-19 01:08:50,894 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-19 01:08:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:51,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:08:51,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:51,334 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:08:51,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:51,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:51,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107038204] [2024-11-19 01:08:51,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107038204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:51,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:51,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:08:51,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442962642] [2024-11-19 01:08:51,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:51,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:08:51,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:51,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:08:51,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:08:51,338 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:51,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:51,401 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-19 01:08:51,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:08:51,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-19 01:08:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:51,408 INFO L225 Difference]: With dead ends: 211 [2024-11-19 01:08:51,408 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 01:08:51,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 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-19 01:08:51,412 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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-19 01:08:51,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:08:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 01:08:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-19 01:08:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:08:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-19 01:08:51,433 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2024-11-19 01:08:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:51,437 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-19 01:08:51,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:51,438 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-19 01:08:51,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 01:08:51,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:51,440 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:51,453 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 (3)] Forceful destruction successful, exit code 0 [2024-11-19 01:08:51,640 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-19 01:08:51,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:51,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:51,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1249640545, now seen corresponding path program 1 times [2024-11-19 01:08:51,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:51,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170089825] [2024-11-19 01:08:51,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:51,643 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-19 01:08:51,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:51,645 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-19 01:08:51,646 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-19 01:08:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:51,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:08:51,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:08:51,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:51,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:51,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170089825] [2024-11-19 01:08:51,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170089825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:51,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:51,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:08:51,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533616979] [2024-11-19 01:08:51,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:51,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:08:51,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:51,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:08:51,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:08:51,997 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:52,148 INFO L93 Difference]: Finished difference Result 218 states and 318 transitions. [2024-11-19 01:08:52,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:08:52,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-19 01:08:52,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:52,151 INFO L225 Difference]: With dead ends: 218 [2024-11-19 01:08:52,151 INFO L226 Difference]: Without dead ends: 113 [2024-11-19 01:08:52,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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-19 01:08:52,153 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:52,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:08:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-19 01:08:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-19 01:08:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:08:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-19 01:08:52,173 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 107 [2024-11-19 01:08:52,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:52,175 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-19 01:08:52,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:52,175 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-19 01:08:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 01:08:52,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:52,177 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:52,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 (4)] Ended with exit code 0 [2024-11-19 01:08:52,378 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-19 01:08:52,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:52,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:52,379 INFO L85 PathProgramCache]: Analyzing trace with hash 525366817, now seen corresponding path program 1 times [2024-11-19 01:08:52,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:52,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770072355] [2024-11-19 01:08:52,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:52,380 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-19 01:08:52,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:52,385 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-19 01:08:52,388 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-19 01:08:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:52,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:08:52,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:08:52,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:52,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:52,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770072355] [2024-11-19 01:08:52,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770072355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:52,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:52,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:08:52,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995539079] [2024-11-19 01:08:52,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:52,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:08:52,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:52,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:08:52,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:08:52,815 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:52,985 INFO L93 Difference]: Finished difference Result 224 states and 323 transitions. [2024-11-19 01:08:52,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:08:52,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-19 01:08:52,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:52,987 INFO L225 Difference]: With dead ends: 224 [2024-11-19 01:08:52,991 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 01:08:52,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 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-19 01:08:52,992 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:52,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:08:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 01:08:53,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-19 01:08:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:08:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2024-11-19 01:08:53,004 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 107 [2024-11-19 01:08:53,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:53,005 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2024-11-19 01:08:53,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:08:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2024-11-19 01:08:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 01:08:53,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:53,007 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:53,019 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 (5)] Ended with exit code 0 [2024-11-19 01:08:53,207 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-19 01:08:53,208 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:53,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash 527213859, now seen corresponding path program 1 times [2024-11-19 01:08:53,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:53,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427640926] [2024-11-19 01:08:53,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:53,209 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-19 01:08:53,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:53,213 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-19 01:08:53,214 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-19 01:08:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:53,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 01:08:53,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:53,595 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 88 treesize of output 87 [2024-11-19 01:08:53,860 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 144 treesize of output 125 [2024-11-19 01:08:54,747 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 139 treesize of output 122 [2024-11-19 01:08:55,721 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 144 treesize of output 127 [2024-11-19 01:08:57,760 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 144 treesize of output 125 [2024-11-19 01:09:00,145 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 145 treesize of output 128 [2024-11-19 01:09:09,006 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 150 treesize of output 133 [2024-11-19 01:09:33,410 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 139 treesize of output 122