./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-73.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 9f2b0f6d9423f5a6deebebe280416f53043b6503d16a3708a82805a986909614 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:44:51,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:44:51,574 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:44:51,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:44:51,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:44:51,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:44:51,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:44:51,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:44:51,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:44:51,608 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:44:51,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:44:51,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:44:51,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:44:51,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:44:51,611 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:44:51,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:44:51,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:44:51,611 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:44:51,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:44:51,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:44:51,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:44:51,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:44:51,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:44:51,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:44:51,615 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:44:51,615 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:44:51,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:44:51,615 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:44:51,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:44:51,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:44:51,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:44:51,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:44:51,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:44:51,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:44:51,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:44:51,617 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:44:51,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:44:51,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:44:51,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:44:51,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:44:51,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:44:51,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:44:51,621 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 -> 9f2b0f6d9423f5a6deebebe280416f53043b6503d16a3708a82805a986909614 [2024-11-12 07:44:51,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:44:51,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:44:51,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:44:51,854 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:44:51,854 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:44:51,855 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-73.i [2024-11-12 07:44:53,278 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:44:53,472 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:44:53,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-73.i [2024-11-12 07:44:53,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4f8bc90/5f7e97d93d9e4865bcf48d91c78169a0/FLAGf6df0d063 [2024-11-12 07:44:53,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4f8bc90/5f7e97d93d9e4865bcf48d91c78169a0 [2024-11-12 07:44:53,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:44:53,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:44:53,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:44:53,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:44:53,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:44:53,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:44:53" (1/1) ... [2024-11-12 07:44:53,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1078ef64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:53, skipping insertion in model container [2024-11-12 07:44:53,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:44:53" (1/1) ... [2024-11-12 07:44:53,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:44:53,752 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-73.i[916,929] [2024-11-12 07:44:53,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:44:53,822 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:44:53,839 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-73.i[916,929] [2024-11-12 07:44:53,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:44:53,896 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:44:53,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:53 WrapperNode [2024-11-12 07:44:53,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:44:53,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:44:53,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:44:53,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:44:53,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:53" (1/1) ... [2024-11-12 07:44:53,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:53" (1/1) ... [2024-11-12 07:44:53,960 INFO L138 Inliner]: procedures = 30, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2024-11-12 07:44:53,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:44:53,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:44:53,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:44:53,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:44:53,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:53" (1/1) ... [2024-11-12 07:44:53,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:53" (1/1) ... [2024-11-12 07:44:53,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:53" (1/1) ... [2024-11-12 07:44:53,991 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-12 07:44:53,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:53" (1/1) ... [2024-11-12 07:44:53,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:53" (1/1) ... [2024-11-12 07:44:54,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:53" (1/1) ... [2024-11-12 07:44:54,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:53" (1/1) ... [2024-11-12 07:44:54,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:53" (1/1) ... [2024-11-12 07:44:54,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:53" (1/1) ... [2024-11-12 07:44:54,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:44:54,031 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:44:54,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:44:54,032 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:44:54,033 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:53" (1/1) ... [2024-11-12 07:44:54,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:44:54,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:44:54,057 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-12 07:44:54,062 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-12 07:44:54,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:44:54,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-12 07:44:54,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-12 07:44:54,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-12 07:44:54,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 07:44:54,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-12 07:44:54,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 07:44:54,093 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:44:54,093 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:44:54,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 07:44:54,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:44:54,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:44:54,181 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:44:54,184 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:44:54,699 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-12 07:44:54,700 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:44:54,717 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:44:54,717 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:44:54,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:44:54 BoogieIcfgContainer [2024-11-12 07:44:54,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:44:54,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:44:54,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:44:54,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:44:54,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:44:53" (1/3) ... [2024-11-12 07:44:54,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32657df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:44:54, skipping insertion in model container [2024-11-12 07:44:54,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:53" (2/3) ... [2024-11-12 07:44:54,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32657df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:44:54, skipping insertion in model container [2024-11-12 07:44:54,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:44:54" (3/3) ... [2024-11-12 07:44:54,727 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-73.i [2024-11-12 07:44:54,740 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:44:54,740 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:44:54,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:44:54,810 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;@22eebf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:44:54,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:44:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:44:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 07:44:54,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:54,828 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:54,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:54,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash -282641606, now seen corresponding path program 1 times [2024-11-12 07:44:54,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:54,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324623931] [2024-11-12 07:44:54,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:54,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:44:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:44:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:44:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:44:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:44:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:44:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:44:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:44:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:44:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:44:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:44:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:44:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:44:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:44:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:44:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:44:55,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:44:55,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324623931] [2024-11-12 07:44:55,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324623931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:55,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:55,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:44:55,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716659089] [2024-11-12 07:44:55,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:55,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:44:55,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:44:55,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:44:55,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:44:55,279 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:44:55,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:55,315 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2024-11-12 07:44:55,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:44:55,317 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-12 07:44:55,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:55,323 INFO L225 Difference]: With dead ends: 213 [2024-11-12 07:44:55,323 INFO L226 Difference]: Without dead ends: 106 [2024-11-12 07:44:55,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-12 07:44:55,329 INFO L435 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-12 07:44:55,330 INFO L436 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-12 07:44:55,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-12 07:44:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-12 07:44:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:44:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-12 07:44:55,367 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2024-11-12 07:44:55,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:55,368 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-12 07:44:55,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:44:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-12 07:44:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 07:44:55,371 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:55,371 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:55,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:44:55,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:55,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:55,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1163314308, now seen corresponding path program 1 times [2024-11-12 07:44:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:55,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178831797] [2024-11-12 07:44:55,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:55,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:44:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:44:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:44:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:44:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:44:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:44:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:44:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:44:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:44:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:44:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:44:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:44:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:44:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:44:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:44:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:44:55,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:44:55,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178831797] [2024-11-12 07:44:55,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178831797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:55,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:55,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:44:55,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122733604] [2024-11-12 07:44:55,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:55,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:44:55,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:44:55,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:44:55,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:44:55,808 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:44:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:55,861 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-12 07:44:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:44:55,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-12 07:44:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:55,864 INFO L225 Difference]: With dead ends: 211 [2024-11-12 07:44:55,865 INFO L226 Difference]: Without dead ends: 108 [2024-11-12 07:44:55,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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-12 07:44:55,867 INFO L435 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-12 07:44:55,868 INFO L436 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-12 07:44:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-12 07:44:55,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-12 07:44:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:44:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-12 07:44:55,887 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2024-11-12 07:44:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:55,891 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-12 07:44:55,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:44:55,891 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-12 07:44:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:44:55,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:55,893 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:55,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:44:55,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:55,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:55,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1992987499, now seen corresponding path program 1 times [2024-11-12 07:44:55,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:55,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639519766] [2024-11-12 07:44:55,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:55,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:44:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:44:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:44:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:44:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:44:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:44:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:44:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:44:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:44:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:44:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:44:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:44:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:44:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:44:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:44:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:44:56,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:44:56,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639519766] [2024-11-12 07:44:56,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639519766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:56,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:56,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:44:56,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682530701] [2024-11-12 07:44:56,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:56,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:44:56,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:44:56,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:44:56,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:44:56,158 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:44:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:56,194 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2024-11-12 07:44:56,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:44:56,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-12 07:44:56,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:56,196 INFO L225 Difference]: With dead ends: 216 [2024-11-12 07:44:56,196 INFO L226 Difference]: Without dead ends: 111 [2024-11-12 07:44:56,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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-12 07:44:56,198 INFO L435 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-12 07:44:56,198 INFO L436 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-12 07:44:56,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-12 07:44:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-12 07:44:56,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:44:56,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-12 07:44:56,214 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 131 [2024-11-12 07:44:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:56,215 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-12 07:44:56,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:44:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-12 07:44:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:44:56,218 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:56,219 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:56,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:44:56,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:56,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1991140457, now seen corresponding path program 1 times [2024-11-12 07:44:56,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:56,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118559339] [2024-11-12 07:44:56,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:56,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:57,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:44:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:57,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:44:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:57,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:44:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:57,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:44:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:57,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:44:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:57,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:44:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:57,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:44:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:57,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:44:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:57,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:44:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:57,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:44:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:57,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:44:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:57,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:44:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:57,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:44:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:57,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:44:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:57,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:44:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:44:57,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:44:57,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118559339] [2024-11-12 07:44:57,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118559339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:57,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:57,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:44:57,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88970235] [2024-11-12 07:44:57,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:57,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:44:57,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:44:57,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:44:57,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:44:57,690 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:44:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:58,185 INFO L93 Difference]: Finished difference Result 326 states and 474 transitions. [2024-11-12 07:44:58,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:44:58,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-12 07:44:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:58,187 INFO L225 Difference]: With dead ends: 326 [2024-11-12 07:44:58,187 INFO L226 Difference]: Without dead ends: 219 [2024-11-12 07:44:58,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:44:58,188 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 99 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:58,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 334 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:44:58,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-12 07:44:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2024-11-12 07:44:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 180 states have (on average 1.3888888888888888) internal successors, (250), 180 states have internal predecessors, (250), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:44:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 310 transitions. [2024-11-12 07:44:58,202 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 310 transitions. Word has length 131 [2024-11-12 07:44:58,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:58,203 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 310 transitions. [2024-11-12 07:44:58,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:44:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 310 transitions. [2024-11-12 07:44:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:44:58,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:58,204 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:58,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:44:58,205 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:58,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:58,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1568438631, now seen corresponding path program 1 times [2024-11-12 07:44:58,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:58,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072553607] [2024-11-12 07:44:58,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:58,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:59,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:44:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:59,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:44:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:59,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:44:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:59,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:44:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:59,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:44:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:59,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:44:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:59,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:44:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:59,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:44:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:59,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:44:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:59,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:44:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:59,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:44:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:59,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:44:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:59,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:44:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:59,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:44:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:59,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:44:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:44:59,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:44:59,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072553607] [2024-11-12 07:44:59,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072553607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:59,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:59,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:44:59,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945029764] [2024-11-12 07:44:59,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:59,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:44:59,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:44:59,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:44:59,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:44:59,317 INFO L87 Difference]: Start difference. First operand 213 states and 310 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:44:59,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:59,714 INFO L93 Difference]: Finished difference Result 476 states and 692 transitions. [2024-11-12 07:44:59,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:44:59,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-12 07:44:59,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:59,717 INFO L225 Difference]: With dead ends: 476 [2024-11-12 07:44:59,718 INFO L226 Difference]: Without dead ends: 266 [2024-11-12 07:44:59,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 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-12 07:44:59,720 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 56 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:59,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 444 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:44:59,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-12 07:44:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 228. [2024-11-12 07:44:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 195 states have (on average 1.4) internal successors, (273), 195 states have internal predecessors, (273), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:44:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 333 transitions. [2024-11-12 07:44:59,746 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 333 transitions. Word has length 131 [2024-11-12 07:44:59,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:59,748 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 333 transitions. [2024-11-12 07:44:59,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:44:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 333 transitions. [2024-11-12 07:44:59,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:44:59,749 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:59,750 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:59,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:44:59,750 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:59,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:59,750 INFO L85 PathProgramCache]: Analyzing trace with hash -557321381, now seen corresponding path program 1 times [2024-11-12 07:44:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:59,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689014786] [2024-11-12 07:44:59,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:59,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:45:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:45:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:45:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:45:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:45:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:45:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:45:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:45:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:45:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:45:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:45:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:45:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:45:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:45:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:45:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:45:00,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:45:00,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689014786] [2024-11-12 07:45:00,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689014786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:45:00,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:45:00,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:45:00,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086045637] [2024-11-12 07:45:00,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:45:00,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:45:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:45:00,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:45:00,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:45:00,862 INFO L87 Difference]: Start difference. First operand 228 states and 333 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:45:01,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:45:01,483 INFO L93 Difference]: Finished difference Result 516 states and 754 transitions. [2024-11-12 07:45:01,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:45:01,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-12 07:45:01,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:45:01,485 INFO L225 Difference]: With dead ends: 516 [2024-11-12 07:45:01,485 INFO L226 Difference]: Without dead ends: 291 [2024-11-12 07:45:01,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:45:01,486 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 168 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:45:01,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 504 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:45:01,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-12 07:45:01,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 226. [2024-11-12 07:45:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 193 states have (on average 1.3937823834196892) internal successors, (269), 193 states have internal predecessors, (269), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:45:01,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 329 transitions. [2024-11-12 07:45:01,497 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 329 transitions. Word has length 131 [2024-11-12 07:45:01,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:45:01,497 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 329 transitions. [2024-11-12 07:45:01,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:45:01,498 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 329 transitions. [2024-11-12 07:45:01,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-12 07:45:01,499 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:45:01,499 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:45:01,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:45:01,499 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:45:01,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:45:01,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1231119539, now seen corresponding path program 1 times [2024-11-12 07:45:01,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:45:01,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510880699] [2024-11-12 07:45:01,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:45:01,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:45:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:02,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:45:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:02,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:45:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:02,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:45:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:02,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:45:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:02,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:45:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:02,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:45:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:02,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:45:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:02,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:45:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:02,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:45:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:02,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:45:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:02,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:45:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:02,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:45:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:02,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:45:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:02,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:45:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:02,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:45:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:45:02,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:45:02,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510880699] [2024-11-12 07:45:02,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510880699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:45:02,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:45:02,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:45:02,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709776449] [2024-11-12 07:45:02,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:45:02,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:45:02,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:45:02,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:45:02,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:45:02,472 INFO L87 Difference]: Start difference. First operand 226 states and 329 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:45:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:45:02,954 INFO L93 Difference]: Finished difference Result 516 states and 750 transitions. [2024-11-12 07:45:02,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:45:02,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-11-12 07:45:02,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:45:02,956 INFO L225 Difference]: With dead ends: 516 [2024-11-12 07:45:02,956 INFO L226 Difference]: Without dead ends: 293 [2024-11-12 07:45:02,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:45:02,959 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 196 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:45:02,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 466 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:45:02,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-12 07:45:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 226. [2024-11-12 07:45:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 193 states have (on average 1.38860103626943) internal successors, (268), 193 states have internal predecessors, (268), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:45:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 328 transitions. [2024-11-12 07:45:02,970 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 328 transitions. Word has length 132 [2024-11-12 07:45:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:45:02,970 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 328 transitions. [2024-11-12 07:45:02,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:45:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 328 transitions. [2024-11-12 07:45:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-12 07:45:02,971 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:45:02,972 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:45:02,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:45:02,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:45:02,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:45:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2042779403, now seen corresponding path program 1 times [2024-11-12 07:45:02,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:45:02,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822978762] [2024-11-12 07:45:02,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:45:02,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:45:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:45:03,056 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:45:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:45:03,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:45:03,142 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:45:03,143 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:45:03,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:45:03,147 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:45:03,213 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:45:03,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:45:03 BoogieIcfgContainer [2024-11-12 07:45:03,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:45:03,216 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:45:03,217 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:45:03,217 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:45:03,217 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:44:54" (3/4) ... [2024-11-12 07:45:03,219 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:45:03,220 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:45:03,221 INFO L158 Benchmark]: Toolchain (without parser) took 9714.99ms. Allocated memory was 174.1MB in the beginning and 490.7MB in the end (delta: 316.7MB). Free memory was 107.0MB in the beginning and 212.5MB in the end (delta: -105.4MB). Peak memory consumption was 212.1MB. Max. memory is 16.1GB. [2024-11-12 07:45:03,221 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 174.1MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:45:03,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.87ms. Allocated memory is still 174.1MB. Free memory was 106.9MB in the beginning and 137.8MB in the end (delta: -31.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 07:45:03,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.60ms. Allocated memory is still 174.1MB. Free memory was 137.8MB in the beginning and 133.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:45:03,221 INFO L158 Benchmark]: Boogie Preprocessor took 68.87ms. Allocated memory is still 174.1MB. Free memory was 133.6MB in the beginning and 130.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:45:03,222 INFO L158 Benchmark]: RCFGBuilder took 687.61ms. Allocated memory is still 174.1MB. Free memory was 130.0MB in the beginning and 95.0MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-12 07:45:03,222 INFO L158 Benchmark]: TraceAbstraction took 8496.25ms. Allocated memory was 174.1MB in the beginning and 490.7MB in the end (delta: 316.7MB). Free memory was 93.8MB in the beginning and 213.5MB in the end (delta: -119.7MB). Peak memory consumption was 199.2MB. Max. memory is 16.1GB. [2024-11-12 07:45:03,222 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 490.7MB. Free memory was 213.5MB in the beginning and 212.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:45:03,224 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.15ms. Allocated memory is still 174.1MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.87ms. Allocated memory is still 174.1MB. Free memory was 106.9MB in the beginning and 137.8MB in the end (delta: -31.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.60ms. Allocated memory is still 174.1MB. Free memory was 137.8MB in the beginning and 133.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.87ms. Allocated memory is still 174.1MB. Free memory was 133.6MB in the beginning and 130.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 687.61ms. Allocated memory is still 174.1MB. Free memory was 130.0MB in the beginning and 95.0MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8496.25ms. Allocated memory was 174.1MB in the beginning and 490.7MB in the end (delta: 316.7MB). Free memory was 93.8MB in the beginning and 213.5MB in the end (delta: -119.7MB). Peak memory consumption was 199.2MB. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 490.7MB. Free memory was 213.5MB in the beginning and 212.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someUnaryDOUBLEoperation at line 42. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L55] float last_1_WrapperStruct00_var_1_12 = 15.75; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_12=63/4] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] EXPR WrapperStruct00.var_1_12 [L117] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L91] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L94] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_7 [L95] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_7 [L95] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L95] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L96] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L98] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L103] EXPR WrapperStruct00.var_1_13 [L103] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_13 [L103] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L103] EXPR (WrapperStruct00.var_1_13 >= 0.0F && 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, last_1_WrapperStruct00_var_1_12=63/4] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && 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, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && 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, last_1_WrapperStruct00_var_1_12=63/4] [L104] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L110] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L111] EXPR WrapperStruct00.var_1_16 [L111] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_16 [L111] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L113] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] RET updateVariables() [L129] CALL step() [L59] WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L59] COND FALSE !(WrapperStruct00.var_1_6) [L62] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L62] COND FALSE !(last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) [L66] EXPR WrapperStruct00.var_1_8 [L66] WrapperStruct00.var_1_19 = WrapperStruct00.var_1_8 [L67] EXPR WrapperStruct00.var_1_19 [L67] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L67] COND FALSE !(WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) [L78] EXPR WrapperStruct00.var_1_13 [L78] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_13 [L80] EXPR WrapperStruct00.var_1_8 [L80] EXPR WrapperStruct00.var_1_8 [L80] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L80] EXPR ((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19)) [L80] EXPR WrapperStruct00.var_1_8 [L80] EXPR WrapperStruct00.var_1_19 [L80] EXPR ((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L80] signed long int stepLocal_0 = (((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))); [L81] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4, stepLocal_0=50] [L81] COND TRUE WrapperStruct00.var_1_8 <= stepLocal_0 [L82] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L82] COND TRUE ! WrapperStruct00.var_1_6 [L83] EXPR WrapperStruct00.var_1_7 [L83] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_7 [L88] EXPR WrapperStruct00.var_1_18 [L88] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_18 [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR ((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19)) [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_19 [L120] EXPR ((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1 [L120] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR WrapperStruct00.var_1_7 [L120] EXPR (! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR ((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((WrapperStruct00.var_1_14 && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR ((((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((WrapperStruct00.var_1_14 && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_13)))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (((((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((WrapperStruct00.var_1_14 && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_13)))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_19 == ((signed long int) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120-L121] return (((((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((WrapperStruct00.var_1_14 && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_13)))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_19 == ((signed long int) WrapperStruct00.var_1_8)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 8, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 521 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 520 mSDsluCounter, 2799 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1885 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1949 IncrementalHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 914 mSDtfsCounter, 1949 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=5, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 177 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1046 NumberOfCodeBlocks, 1046 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 907 ConstructedInterpolants, 0 QuantifiedInterpolants, 2486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 2940/2940 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-12 07:45:03,257 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-73.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 9f2b0f6d9423f5a6deebebe280416f53043b6503d16a3708a82805a986909614 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:45:05,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:45:05,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:45:05,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:45:05,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:45:05,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:45:05,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:45:05,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:45:05,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:45:05,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:45:05,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:45:05,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:45:05,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:45:05,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:45:05,626 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:45:05,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:45:05,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:45:05,627 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:45:05,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:45:05,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:45:05,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:45:05,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:45:05,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:45:05,648 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:45:05,652 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:45:05,652 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:45:05,653 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:45:05,653 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:45:05,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:45:05,653 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:45:05,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:45:05,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:45:05,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:45:05,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:45:05,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:45:05,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:45:05,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:45:05,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:45:05,661 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:45:05,661 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:45:05,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:45:05,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:45:05,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:45:05,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:45:05,666 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 -> 9f2b0f6d9423f5a6deebebe280416f53043b6503d16a3708a82805a986909614 [2024-11-12 07:45:06,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:45:06,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:45:06,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:45:06,037 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:45:06,037 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:45:06,038 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-73.i [2024-11-12 07:45:07,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:45:07,814 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:45:07,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-73.i [2024-11-12 07:45:07,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cdee958a/1a5388994d374eb09083642894b5dd3c/FLAG93ad657cb [2024-11-12 07:45:07,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cdee958a/1a5388994d374eb09083642894b5dd3c [2024-11-12 07:45:07,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:45:07,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:45:07,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:45:07,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:45:07,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:45:07,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:45:07" (1/1) ... [2024-11-12 07:45:07,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404a7799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:45:07, skipping insertion in model container [2024-11-12 07:45:07,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:45:07" (1/1) ... [2024-11-12 07:45:07,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:45:08,003 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-73.i[916,929] [2024-11-12 07:45:08,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:45:08,070 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:45:08,081 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-73.i[916,929] [2024-11-12 07:45:08,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:45:08,166 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:45:08,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:45:08 WrapperNode [2024-11-12 07:45:08,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:45:08,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:45:08,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:45:08,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:45:08,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:45:08" (1/1) ... [2024-11-12 07:45:08,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:45:08" (1/1) ... [2024-11-12 07:45:08,237 INFO L138 Inliner]: procedures = 37, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 490 [2024-11-12 07:45:08,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:45:08,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:45:08,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:45:08,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:45:08,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:45:08" (1/1) ... [2024-11-12 07:45:08,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:45:08" (1/1) ... [2024-11-12 07:45:08,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:45:08" (1/1) ... [2024-11-12 07:45:08,278 INFO L175 MemorySlicer]: Split 135 memory accesses to 2 slices as follows [2, 133]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2024-11-12 07:45:08,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:45:08" (1/1) ... [2024-11-12 07:45:08,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:45:08" (1/1) ... [2024-11-12 07:45:08,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:45:08" (1/1) ... [2024-11-12 07:45:08,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:45:08" (1/1) ... [2024-11-12 07:45:08,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:45:08" (1/1) ... [2024-11-12 07:45:08,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:45:08" (1/1) ... [2024-11-12 07:45:08,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:45:08,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:45:08,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:45:08,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:45:08,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:45:08" (1/1) ... [2024-11-12 07:45:08,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:45:08,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:45:08,354 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-12 07:45:08,361 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-12 07:45:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:45:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-12 07:45:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-12 07:45:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-12 07:45:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-12 07:45:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-12 07:45:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-12 07:45:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:45:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:45:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:45:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-12 07:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-12 07:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-12 07:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-12 07:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-12 07:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-12 07:45:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-12 07:45:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-12 07:45:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:45:08,400 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:45:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-12 07:45:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-12 07:45:08,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:45:08,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:45:08,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:45:08,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:45:08,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:45:08,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:45:08,499 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:45:08,501 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:45:11,412 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-12 07:45:11,412 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:45:11,422 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:45:11,422 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:45:11,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:45:11 BoogieIcfgContainer [2024-11-12 07:45:11,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:45:11,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:45:11,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:45:11,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:45:11,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:45:07" (1/3) ... [2024-11-12 07:45:11,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dedaad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:45:11, skipping insertion in model container [2024-11-12 07:45:11,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:45:08" (2/3) ... [2024-11-12 07:45:11,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dedaad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:45:11, skipping insertion in model container [2024-11-12 07:45:11,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:45:11" (3/3) ... [2024-11-12 07:45:11,430 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-73.i [2024-11-12 07:45:11,443 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:45:11,443 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:45:11,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:45:11,503 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;@1b06d2bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:45:11,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:45:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:45:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 07:45:11,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:45:11,521 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:45:11,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:45:11,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:45:11,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2041388229, now seen corresponding path program 1 times [2024-11-12 07:45:11,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:45:11,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552109779] [2024-11-12 07:45:11,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:45:11,542 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-12 07:45:11,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:45:11,545 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-12 07:45:11,547 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-12 07:45:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:11,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:45:11,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:45:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-12 07:45:12,007 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:45:12,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:45:12,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552109779] [2024-11-12 07:45:12,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552109779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:45:12,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:45:12,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:45:12,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702831942] [2024-11-12 07:45:12,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:45:12,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:45:12,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:45:12,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:45:12,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:45:12,036 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:45:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:45:12,088 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2024-11-12 07:45:12,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:45:12,091 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-12 07:45:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:45:12,110 INFO L225 Difference]: With dead ends: 213 [2024-11-12 07:45:12,111 INFO L226 Difference]: Without dead ends: 106 [2024-11-12 07:45:12,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-12 07:45:12,121 INFO L435 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-12 07:45:12,122 INFO L436 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-12 07:45:12,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-12 07:45:12,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-12 07:45:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:45:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-12 07:45:12,190 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2024-11-12 07:45:12,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:45:12,190 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-12 07:45:12,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:45:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-12 07:45:12,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 07:45:12,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:45:12,195 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:45:12,207 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 (2)] Forceful destruction successful, exit code 0 [2024-11-12 07:45:12,396 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-12 07:45:12,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:45:12,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:45:12,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1160715527, now seen corresponding path program 1 times [2024-11-12 07:45:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:45:12,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981502320] [2024-11-12 07:45:12,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:45:12,403 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-12 07:45:12,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:45:12,406 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-12 07:45:12,414 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-12 07:45:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:12,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:45:12,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:45:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-11-12 07:45:12,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:45:12,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:45:12,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981502320] [2024-11-12 07:45:12,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981502320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:45:12,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:45:12,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:45:12,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067132940] [2024-11-12 07:45:12,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:45:12,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:45:12,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:45:12,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:45:12,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:45:12,781 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:45:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:45:12,908 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-12 07:45:12,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:45:12,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-12 07:45:12,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:45:12,911 INFO L225 Difference]: With dead ends: 211 [2024-11-12 07:45:12,912 INFO L226 Difference]: Without dead ends: 108 [2024-11-12 07:45:12,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 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-12 07:45:12,914 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:45:12,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:45:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-12 07:45:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-12 07:45:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:45:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-12 07:45:12,929 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2024-11-12 07:45:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:45:12,930 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-12 07:45:12,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:45:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-12 07:45:12,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 07:45:12,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:45:12,934 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:45:12,943 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-12 07:45:13,134 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-12 07:45:13,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:45:13,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:45:13,137 INFO L85 PathProgramCache]: Analyzing trace with hash 689359177, now seen corresponding path program 1 times [2024-11-12 07:45:13,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:45:13,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104301516] [2024-11-12 07:45:13,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:45:13,139 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-12 07:45:13,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:45:13,142 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-12 07:45:13,143 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-12 07:45:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:13,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:45:13,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:45:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:45:13,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:45:13,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:45:13,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104301516] [2024-11-12 07:45:13,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104301516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:45:13,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:45:13,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:45:13,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801939633] [2024-11-12 07:45:13,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:45:13,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:45:13,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:45:13,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:45:13,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:45:13,418 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:45:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:45:13,452 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2024-11-12 07:45:13,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:45:13,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-12 07:45:13,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:45:13,453 INFO L225 Difference]: With dead ends: 215 [2024-11-12 07:45:13,453 INFO L226 Difference]: Without dead ends: 110 [2024-11-12 07:45:13,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 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-12 07:45:13,455 INFO L435 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-12 07:45:13,455 INFO L436 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-12 07:45:13,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-12 07:45:13,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-12 07:45:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:45:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-12 07:45:13,461 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 129 [2024-11-12 07:45:13,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:45:13,462 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-12 07:45:13,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:45:13,462 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-12 07:45:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:45:13,463 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:45:13,463 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:45:13,476 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-12 07:45:13,664 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-12 07:45:13,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:45:13,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:45:13,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1547220764, now seen corresponding path program 1 times [2024-11-12 07:45:13,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:45:13,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038194767] [2024-11-12 07:45:13,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:45:13,666 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-12 07:45:13,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:45:13,670 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-12 07:45:13,680 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-12 07:45:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:13,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:45:13,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:45:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:45:14,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:45:14,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:45:14,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038194767] [2024-11-12 07:45:14,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038194767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:45:14,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:45:14,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:45:14,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671559051] [2024-11-12 07:45:14,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:45:14,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:45:14,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:45:14,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:45:14,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:45:14,019 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:45:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:45:14,059 INFO L93 Difference]: Finished difference Result 222 states and 322 transitions. [2024-11-12 07:45:14,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:45:14,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-12 07:45:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:45:14,061 INFO L225 Difference]: With dead ends: 222 [2024-11-12 07:45:14,061 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 07:45:14,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 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-12 07:45:14,062 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:45:14,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:45:14,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 07:45:14,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-12 07:45:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:45:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2024-11-12 07:45:14,068 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 131 [2024-11-12 07:45:14,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:45:14,068 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2024-11-12 07:45:14,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:45:14,068 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2024-11-12 07:45:14,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:45:14,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:45:14,073 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:45:14,083 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-12 07:45:14,273 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-12 07:45:14,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:45:14,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:45:14,274 INFO L85 PathProgramCache]: Analyzing trace with hash 227786598, now seen corresponding path program 1 times [2024-11-12 07:45:14,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:45:14,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416325793] [2024-11-12 07:45:14,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:45:14,275 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-12 07:45:14,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:45:14,281 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-12 07:45:14,282 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-12 07:45:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:14,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:45:14,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:45:14,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-12 07:45:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-12 07:45:14,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:45:14,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:45:14,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416325793] [2024-11-12 07:45:14,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416325793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:45:14,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:45:14,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:45:14,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938974274] [2024-11-12 07:45:14,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:45:14,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:45:14,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:45:14,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:45:14,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:45:14,835 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:45:16,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:45:16,759 INFO L93 Difference]: Finished difference Result 226 states and 324 transitions. [2024-11-12 07:45:16,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:45:16,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-12 07:45:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:45:16,761 INFO L225 Difference]: With dead ends: 226 [2024-11-12 07:45:16,761 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 07:45:16,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:45:16,762 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 123 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-12 07:45:16,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 438 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-12 07:45:16,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 07:45:16,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-12 07:45:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:45:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-12 07:45:16,780 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 131 [2024-11-12 07:45:16,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:45:16,780 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-12 07:45:16,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:45:16,780 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-12 07:45:16,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 07:45:16,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:45:16,782 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:45:16,795 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 (6)] Forceful destruction successful, exit code 0 [2024-11-12 07:45:16,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:45:16,983 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:45:16,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:45:16,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1395501140, now seen corresponding path program 1 times [2024-11-12 07:45:16,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:45:16,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940237564] [2024-11-12 07:45:16,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:45:16,985 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-12 07:45:16,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:45:16,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:45:16,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 07:45:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:17,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:45:17,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:45:17,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-12 07:45:17,464 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-12 07:45:17,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:45:17,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:45:17,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940237564] [2024-11-12 07:45:17,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940237564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:45:17,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:45:17,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:45:17,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912865462] [2024-11-12 07:45:17,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:45:17,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:45:17,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:45:17,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:45:17,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:45:17,467 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:45:18,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:45:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:45:20,589 INFO L93 Difference]: Finished difference Result 226 states and 322 transitions. [2024-11-12 07:45:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:45:20,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2024-11-12 07:45:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:45:20,591 INFO L225 Difference]: With dead ends: 226 [2024-11-12 07:45:20,591 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 07:45:20,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:45:20,592 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 102 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:45:20,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 434 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-12 07:45:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 07:45:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-12 07:45:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:45:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 161 transitions. [2024-11-12 07:45:20,604 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 161 transitions. Word has length 133 [2024-11-12 07:45:20,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:45:20,605 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 161 transitions. [2024-11-12 07:45:20,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:45:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2024-11-12 07:45:20,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:45:20,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:45:20,606 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:45:20,623 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 (7)] Ended with exit code 0 [2024-11-12 07:45:20,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:45:20,807 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:45:20,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:45:20,810 INFO L85 PathProgramCache]: Analyzing trace with hash 752811686, now seen corresponding path program 1 times [2024-11-12 07:45:20,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:45:20,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053388665] [2024-11-12 07:45:20,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:45:20,811 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-12 07:45:20,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:45:20,812 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:45:20,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 07:45:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:21,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 07:45:21,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:45:21,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-12 07:45:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:45:21,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:45:21,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:45:21,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053388665] [2024-11-12 07:45:21,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053388665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:45:21,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:45:21,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:45:21,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775903158] [2024-11-12 07:45:21,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:45:21,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:45:21,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:45:21,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:45:21,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:45:21,203 INFO L87 Difference]: Start difference. First operand 114 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:45:22,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:45:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:45:23,752 INFO L93 Difference]: Finished difference Result 227 states and 322 transitions. [2024-11-12 07:45:23,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:45:23,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-12 07:45:23,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:45:23,753 INFO L225 Difference]: With dead ends: 227 [2024-11-12 07:45:23,754 INFO L226 Difference]: Without dead ends: 116 [2024-11-12 07:45:23,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 132 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-12 07:45:23,755 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:45:23,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-12 07:45:23,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-12 07:45:23,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-12 07:45:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:45:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 163 transitions. [2024-11-12 07:45:23,760 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 163 transitions. Word has length 135 [2024-11-12 07:45:23,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:45:23,760 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 163 transitions. [2024-11-12 07:45:23,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:45:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 163 transitions. [2024-11-12 07:45:23,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:45:23,761 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:45:23,762 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:45:23,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 07:45:23,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:45:23,962 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:45:23,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:45:23,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1175513512, now seen corresponding path program 1 times [2024-11-12 07:45:23,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:45:23,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886220932] [2024-11-12 07:45:23,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:45:23,963 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-12 07:45:23,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:45:23,966 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:45:23,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 07:45:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:24,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:45:24,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:45:24,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:24,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 22 [2024-11-12 07:45:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:45:24,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:45:24,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:45:24,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886220932] [2024-11-12 07:45:24,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886220932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:45:24,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:45:24,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:45:24,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616087830] [2024-11-12 07:45:24,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:45:24,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:45:24,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:45:24,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:45:24,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:45:24,370 INFO L87 Difference]: Start difference. First operand 116 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:45:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:45:26,510 INFO L93 Difference]: Finished difference Result 229 states and 323 transitions. [2024-11-12 07:45:26,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:45:26,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-12 07:45:26,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:45:26,512 INFO L225 Difference]: With dead ends: 229 [2024-11-12 07:45:26,512 INFO L226 Difference]: Without dead ends: 116 [2024-11-12 07:45:26,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 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-12 07:45:26,513 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:45:26,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-12 07:45:26,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-12 07:45:26,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-12 07:45:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 97 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:45:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-11-12 07:45:26,519 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 135 [2024-11-12 07:45:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:45:26,520 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-11-12 07:45:26,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:45:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-11-12 07:45:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:45:26,521 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:45:26,521 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:45:26,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-12 07:45:26,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:45:26,722 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:45:26,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:45:26,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1295579430, now seen corresponding path program 1 times [2024-11-12 07:45:26,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:45:26,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632927613] [2024-11-12 07:45:26,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:45:26,723 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-12 07:45:26,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:45:26,726 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:45:26,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 07:45:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:27,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-12 07:45:27,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:45:27,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:45:27,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:45:27,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:45:27,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 31 [2024-11-12 07:45:27,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:27,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2024-11-12 07:45:27,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:27,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 53 [2024-11-12 07:45:27,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:27,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 54 [2024-11-12 07:45:28,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:28,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 44 [2024-11-12 07:45:28,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:28,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-11-12 07:45:28,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:28,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-11-12 07:45:28,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:28,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2024-11-12 07:45:28,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:28,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2024-11-12 07:45:28,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:28,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2024-11-12 07:45:28,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:28,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2024-11-12 07:45:29,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:29,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 67 [2024-11-12 07:45:29,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:29,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 87 treesize of output 33 [2024-11-12 07:45:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 100 proven. 224 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-12 07:45:29,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:45:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:45:29,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:45:29,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632927613] [2024-11-12 07:45:29,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632927613] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:45:29,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:45:29,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-12 07:45:29,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507159498] [2024-11-12 07:45:29,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:45:29,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:45:29,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:45:29,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:45:29,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:45:29,342 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:45:31,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:45:31,395 INFO L93 Difference]: Finished difference Result 286 states and 403 transitions. [2024-11-12 07:45:31,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:45:31,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-11-12 07:45:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:45:31,397 INFO L225 Difference]: With dead ends: 286 [2024-11-12 07:45:31,397 INFO L226 Difference]: Without dead ends: 175 [2024-11-12 07:45:31,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:45:31,398 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 129 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:45:31,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 371 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 07:45:31,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-12 07:45:31,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 114. [2024-11-12 07:45:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3298969072164948) internal successors, (129), 97 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:45:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2024-11-12 07:45:31,415 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 136 [2024-11-12 07:45:31,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:45:31,416 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2024-11-12 07:45:31,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:45:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2024-11-12 07:45:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:45:31,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:45:31,417 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:45:31,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-12 07:45:31,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:45:31,619 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:45:31,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:45:31,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1514434148, now seen corresponding path program 1 times [2024-11-12 07:45:31,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:45:31,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110503652] [2024-11-12 07:45:31,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:45:31,622 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-12 07:45:31,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:45:31,623 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:45:31,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 07:45:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:32,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-12 07:45:32,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:45:32,216 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 8 treesize of output 1 [2024-11-12 07:45:32,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:32,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 59 [2024-11-12 07:45:32,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:32,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 59 [2024-11-12 07:45:32,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:32,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 59 [2024-11-12 07:45:32,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:32,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 69 [2024-11-12 07:45:32,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:32,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2024-11-12 07:45:33,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:33,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2024-11-12 07:45:33,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:33,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2024-11-12 07:45:33,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:33,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 92 [2024-11-12 07:45:33,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:33,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 159 treesize of output 95 [2024-11-12 07:45:33,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:33,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 215 treesize of output 134 [2024-11-12 07:45:33,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:33,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 236 treesize of output 160 [2024-11-12 07:45:34,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:34,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 428 treesize of output 148 [2024-11-12 07:45:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 104 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-12 07:45:34,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:45:34,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:45:34,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110503652] [2024-11-12 07:45:34,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110503652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:45:34,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [862510827] [2024-11-12 07:45:34,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:45:34,825 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 07:45:34,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 07:45:34,828 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 07:45:34,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-12 07:45:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:36,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-12 07:45:36,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:45:36,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-12 07:45:37,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:37,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 71 [2024-11-12 07:45:37,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:37,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 80 [2024-11-12 07:45:38,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:38,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 80 [2024-11-12 07:45:38,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:38,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 88 [2024-11-12 07:45:38,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:38,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 45 [2024-11-12 07:45:39,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:39,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 45 [2024-11-12 07:45:39,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:39,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 45 [2024-11-12 07:45:40,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:40,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 61 [2024-11-12 07:45:40,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:40,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 64 [2024-11-12 07:45:40,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:40,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 107 treesize of output 101 [2024-11-12 07:45:40,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:40,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 115 treesize of output 126 [2024-11-12 07:45:41,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:41,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 235 treesize of output 99 [2024-11-12 07:45:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 104 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-12 07:45:41,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:45:41,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [862510827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:45:41,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:45:41,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2024-11-12 07:45:41,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913718286] [2024-11-12 07:45:41,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:45:41,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 07:45:41,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:45:41,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 07:45:41,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2024-11-12 07:45:41,621 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 23 states have internal predecessors, (130), 7 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) [2024-11-12 07:45:43,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:45:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:45:55,874 INFO L93 Difference]: Finished difference Result 345 states and 476 transitions. [2024-11-12 07:45:55,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 07:45:55,875 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 23 states have internal predecessors, (130), 7 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) Word has length 136 [2024-11-12 07:45:55,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:45:55,878 INFO L225 Difference]: With dead ends: 345 [2024-11-12 07:45:55,878 INFO L226 Difference]: Without dead ends: 234 [2024-11-12 07:45:55,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=319, Invalid=1403, Unknown=0, NotChecked=0, Total=1722 [2024-11-12 07:45:55,882 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 893 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:45:55,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 601 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2024-11-12 07:45:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-12 07:45:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 228. [2024-11-12 07:45:55,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 190 states have (on average 1.3157894736842106) internal successors, (250), 192 states have internal predecessors, (250), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 07:45:55,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 314 transitions. [2024-11-12 07:45:55,916 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 314 transitions. Word has length 136 [2024-11-12 07:45:55,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:45:55,919 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 314 transitions. [2024-11-12 07:45:55,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 23 states have internal predecessors, (130), 7 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) [2024-11-12 07:45:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 314 transitions. [2024-11-12 07:45:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-12 07:45:55,920 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:45:55,921 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:45:55,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-12 07:45:56,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-12 07:45:56,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 07:45:56,328 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:45:56,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:45:56,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1081826860, now seen corresponding path program 1 times [2024-11-12 07:45:56,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:45:56,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637678420] [2024-11-12 07:45:56,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:45:56,334 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-12 07:45:56,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:45:56,337 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:45:56,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-12 07:45:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:56,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:45:56,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:45:56,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:56,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 67 [2024-11-12 07:45:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 8 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-12 07:45:56,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:45:57,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:57,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 1 [2024-11-12 07:45:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-12 07:45:57,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:45:57,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637678420] [2024-11-12 07:45:57,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637678420] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:45:57,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:45:57,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-12 07:45:57,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223980676] [2024-11-12 07:45:57,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:45:57,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:45:57,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:45:57,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:45:57,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:45:57,174 INFO L87 Difference]: Start difference. First operand 228 states and 314 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2024-11-12 07:46:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:46:02,669 INFO L93 Difference]: Finished difference Result 472 states and 643 transitions. [2024-11-12 07:46:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 07:46:02,673 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) Word has length 138 [2024-11-12 07:46:02,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:46:02,675 INFO L225 Difference]: With dead ends: 472 [2024-11-12 07:46:02,675 INFO L226 Difference]: Without dead ends: 241 [2024-11-12 07:46:02,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2024-11-12 07:46:02,676 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 141 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:46:02,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 590 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-12 07:46:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-12 07:46:02,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 221. [2024-11-12 07:46:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 185 states have (on average 1.3135135135135134) internal successors, (243), 186 states have internal predecessors, (243), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:46:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 303 transitions. [2024-11-12 07:46:02,713 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 303 transitions. Word has length 138 [2024-11-12 07:46:02,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:46:02,713 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 303 transitions. [2024-11-12 07:46:02,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2024-11-12 07:46:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 303 transitions. [2024-11-12 07:46:02,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-12 07:46:02,720 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:46:02,720 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:46:02,737 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 (13)] Forceful destruction successful, exit code 0 [2024-11-12 07:46:02,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-12 07:46:02,921 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:46:02,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:46:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1297717152, now seen corresponding path program 1 times [2024-11-12 07:46:02,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:46:02,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942778162] [2024-11-12 07:46:02,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:46:02,923 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-12 07:46:02,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:46:02,925 INFO L229 MonitoredProcess]: Starting monitored process 14 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-12 07:46:02,926 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 (14)] Waiting until timeout for monitored process [2024-11-12 07:46:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:46:03,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 07:46:03,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:46:03,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:03,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 22 [2024-11-12 07:46:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:46:03,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:46:03,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:46:03,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942778162] [2024-11-12 07:46:03,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942778162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:46:03,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:46:03,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:46:03,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307524103] [2024-11-12 07:46:03,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:46:03,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:46:03,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:46:03,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:46:03,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:46:03,398 INFO L87 Difference]: Start difference. First operand 221 states and 303 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:46:04,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:46:04,962 INFO L93 Difference]: Finished difference Result 437 states and 601 transitions. [2024-11-12 07:46:04,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:46:04,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2024-11-12 07:46:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:46:04,967 INFO L225 Difference]: With dead ends: 437 [2024-11-12 07:46:04,967 INFO L226 Difference]: Without dead ends: 219 [2024-11-12 07:46:04,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 135 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-12 07:46:04,968 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:46:04,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 07:46:04,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-12 07:46:04,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-12 07:46:04,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 184 states have internal predecessors, (239), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:46:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 299 transitions. [2024-11-12 07:46:04,988 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 299 transitions. Word has length 138 [2024-11-12 07:46:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:46:04,988 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 299 transitions. [2024-11-12 07:46:04,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:46:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 299 transitions. [2024-11-12 07:46:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-12 07:46:04,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:46:04,989 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:46:05,002 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 (14)] Forceful destruction successful, exit code 0 [2024-11-12 07:46:05,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-12 07:46:05,193 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:46:05,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:46:05,194 INFO L85 PathProgramCache]: Analyzing trace with hash 593779754, now seen corresponding path program 1 times [2024-11-12 07:46:05,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:46:05,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528288367] [2024-11-12 07:46:05,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:46:05,194 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-12 07:46:05,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:46:05,199 INFO L229 MonitoredProcess]: Starting monitored process 15 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-12 07:46:05,201 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 (15)] Waiting until timeout for monitored process [2024-11-12 07:46:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:46:06,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-12 07:46:06,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:46:06,045 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 8 treesize of output 1 [2024-11-12 07:46:06,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:06,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 57 [2024-11-12 07:46:06,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:06,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 57 [2024-11-12 07:46:06,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:06,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 57 [2024-11-12 07:46:06,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:06,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 67 [2024-11-12 07:46:06,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:06,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 80 [2024-11-12 07:46:07,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:07,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 83 [2024-11-12 07:46:07,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:07,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 83 [2024-11-12 07:46:08,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:08,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 103 [2024-11-12 07:46:08,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:08,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 167 treesize of output 106 [2024-11-12 07:46:08,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:08,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 223 treesize of output 145 [2024-11-12 07:46:08,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:08,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 244 treesize of output 171 [2024-11-12 07:46:08,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:08,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 436 treesize of output 150 [2024-11-12 07:46:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 192 proven. 140 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-12 07:46:09,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:46:09,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:46:09,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528288367] [2024-11-12 07:46:09,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528288367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:46:09,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2102623460] [2024-11-12 07:46:09,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:46:09,475 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 07:46:09,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 07:46:09,477 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 07:46:09,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-12 07:46:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:46:11,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-12 07:46:11,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:46:11,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:46:11,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:46:11,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:46:11,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:46:11,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:46:11,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:46:11,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 61 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 33 [2024-11-12 07:46:11,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:11,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 79 treesize of output 39 [2024-11-12 07:46:12,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-12 07:46:21,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:21,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 69 [2024-11-12 07:46:22,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:22,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2024-11-12 07:46:23,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:23,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 45 [2024-11-12 07:46:23,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:23,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 53 [2024-11-12 07:46:24,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:24,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 56 [2024-11-12 07:46:24,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:24,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 56 [2024-11-12 07:46:25,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:46:25,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 64