./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.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-63.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 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:43:34,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:43:34,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:43:34,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:43:34,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:43:34,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:43:34,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:43:34,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:43:34,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:43:34,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:43:34,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:43:34,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:43:34,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:43:34,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:43:34,766 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:43:34,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:43:34,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:43:34,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:43:34,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:43:34,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:43:34,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:43:34,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:43:34,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:43:34,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:43:34,772 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:43:34,772 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:43:34,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:43:34,773 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:43:34,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:43:34,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:43:34,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:43:34,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:43:34,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:43:34,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:43:34,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:43:34,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:43:34,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:43:34,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:43:34,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:43:34,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:43:34,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:43:34,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:43:34,778 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 -> 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 [2024-11-12 07:43:35,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:43:35,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:43:35,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:43:35,095 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:43:35,095 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:43:35,096 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-63.i [2024-11-12 07:43:36,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:43:36,729 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:43:36,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i [2024-11-12 07:43:36,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a0933347/48fbc86b6abb4b708158a6321a5f52d5/FLAG474bfb5d3 [2024-11-12 07:43:36,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a0933347/48fbc86b6abb4b708158a6321a5f52d5 [2024-11-12 07:43:36,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:43:36,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:43:36,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:43:36,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:43:36,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:43:36,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:43:36" (1/1) ... [2024-11-12 07:43:36,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d9f20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:36, skipping insertion in model container [2024-11-12 07:43:36,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:43:36" (1/1) ... [2024-11-12 07:43:36,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:43:36,959 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i[916,929] [2024-11-12 07:43:37,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:43:37,026 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:43:37,037 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-63.i[916,929] [2024-11-12 07:43:37,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:43:37,114 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:43:37,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:37 WrapperNode [2024-11-12 07:43:37,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:43:37,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:43:37,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:43:37,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:43:37,124 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:43:37" (1/1) ... [2024-11-12 07:43:37,144 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:43:37" (1/1) ... [2024-11-12 07:43:37,182 INFO L138 Inliner]: procedures = 30, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 661 [2024-11-12 07:43:37,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:43:37,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:43:37,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:43:37,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:43:37,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:37" (1/1) ... [2024-11-12 07:43:37,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:37" (1/1) ... [2024-11-12 07:43:37,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:37" (1/1) ... [2024-11-12 07:43:37,212 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-12 07:43:37,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:37" (1/1) ... [2024-11-12 07:43:37,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:37" (1/1) ... [2024-11-12 07:43:37,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:37" (1/1) ... [2024-11-12 07:43:37,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:37" (1/1) ... [2024-11-12 07:43:37,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:37" (1/1) ... [2024-11-12 07:43:37,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:37" (1/1) ... [2024-11-12 07:43:37,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:43:37,257 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:43:37,257 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:43:37,257 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:43:37,258 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:37" (1/1) ... [2024-11-12 07:43:37,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:43:37,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:43:37,320 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:43:37,326 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:43:37,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:43:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-12 07:43:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-12 07:43:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-12 07:43:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 07:43:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-12 07:43:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 07:43:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:43:37,374 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:43:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 07:43:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:43:37,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:43:37,525 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:43:37,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:43:38,496 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2024-11-12 07:43:38,497 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:43:38,510 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:43:38,511 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:43:38,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:43:38 BoogieIcfgContainer [2024-11-12 07:43:38,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:43:38,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:43:38,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:43:38,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:43:38,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:43:36" (1/3) ... [2024-11-12 07:43:38,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1deb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:43:38, skipping insertion in model container [2024-11-12 07:43:38,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:37" (2/3) ... [2024-11-12 07:43:38,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1deb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:43:38, skipping insertion in model container [2024-11-12 07:43:38,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:43:38" (3/3) ... [2024-11-12 07:43:38,521 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-63.i [2024-11-12 07:43:38,543 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:43:38,543 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:43:38,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:43:38,604 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;@5068546c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:43:38,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:43:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:43:38,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-12 07:43:38,621 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:38,622 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:38,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:38,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:38,629 INFO L85 PathProgramCache]: Analyzing trace with hash 79458764, now seen corresponding path program 1 times [2024-11-12 07:43:38,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:38,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248160002] [2024-11-12 07:43:38,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:38,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:43:39,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:39,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248160002] [2024-11-12 07:43:39,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248160002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:39,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:39,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:43:39,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649331390] [2024-11-12 07:43:39,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:39,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:43:39,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:39,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:43:39,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:43:39,254 INFO L87 Difference]: Start difference. First operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 07:43:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:39,294 INFO L93 Difference]: Finished difference Result 271 states and 422 transitions. [2024-11-12 07:43:39,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:43:39,296 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-12 07:43:39,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:39,304 INFO L225 Difference]: With dead ends: 271 [2024-11-12 07:43:39,304 INFO L226 Difference]: Without dead ends: 135 [2024-11-12 07:43:39,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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:43:39,314 INFO L435 NwaCegarLoop]: 198 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, 198 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:43:39,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:43:39,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-12 07:43:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-12 07:43:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:43:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-12 07:43:39,364 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2024-11-12 07:43:39,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:39,365 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-12 07:43:39,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 07:43:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-12 07:43:39,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-12 07:43:39,368 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:39,369 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:39,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:43:39,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:39,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:39,370 INFO L85 PathProgramCache]: Analyzing trace with hash 509231968, now seen corresponding path program 1 times [2024-11-12 07:43:39,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:39,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485603823] [2024-11-12 07:43:39,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:39,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:43:39,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:39,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485603823] [2024-11-12 07:43:39,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485603823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:39,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:39,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:43:39,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305308065] [2024-11-12 07:43:39,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:39,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:43:39,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:39,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:43:39,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:43:39,811 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 07:43:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:39,884 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2024-11-12 07:43:39,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:43:39,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-12 07:43:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:39,887 INFO L225 Difference]: With dead ends: 269 [2024-11-12 07:43:39,887 INFO L226 Difference]: Without dead ends: 137 [2024-11-12 07:43:39,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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:43:39,889 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 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:43:39,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:43:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-12 07:43:39,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-12 07:43:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:43:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-12 07:43:39,903 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2024-11-12 07:43:39,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:39,904 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-12 07:43:39,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 07:43:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-12 07:43:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-12 07:43:39,907 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:39,907 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:39,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:43:39,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:39,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:39,908 INFO L85 PathProgramCache]: Analyzing trace with hash 145765470, now seen corresponding path program 1 times [2024-11-12 07:43:39,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:39,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135071951] [2024-11-12 07:43:39,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:39,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:43:40,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:40,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135071951] [2024-11-12 07:43:40,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135071951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:40,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:40,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:43:40,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573190209] [2024-11-12 07:43:40,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:40,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:43:40,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:40,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:43:40,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:43:40,278 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:40,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:40,315 INFO L93 Difference]: Finished difference Result 273 states and 400 transitions. [2024-11-12 07:43:40,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:43:40,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-12 07:43:40,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:40,318 INFO L225 Difference]: With dead ends: 273 [2024-11-12 07:43:40,318 INFO L226 Difference]: Without dead ends: 139 [2024-11-12 07:43:40,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 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:43:40,320 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 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:43:40,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:43:40,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-12 07:43:40,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-12 07:43:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:43:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2024-11-12 07:43:40,330 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 156 [2024-11-12 07:43:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:40,332 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2024-11-12 07:43:40,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2024-11-12 07:43:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 07:43:40,334 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:40,334 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:40,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:43:40,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:40,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:40,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1498114201, now seen corresponding path program 1 times [2024-11-12 07:43:40,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:40,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130235603] [2024-11-12 07:43:40,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:40,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:43:40,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:40,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130235603] [2024-11-12 07:43:40,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130235603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:40,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:40,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:43:40,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906323250] [2024-11-12 07:43:40,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:40,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:43:40,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:40,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:43:40,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:43:40,604 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:40,636 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2024-11-12 07:43:40,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:43:40,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-12 07:43:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:40,640 INFO L225 Difference]: With dead ends: 278 [2024-11-12 07:43:40,640 INFO L226 Difference]: Without dead ends: 142 [2024-11-12 07:43:40,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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:43:40,642 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:40,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:43:40,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-12 07:43:40,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-11-12 07:43:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:43:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2024-11-12 07:43:40,654 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 158 [2024-11-12 07:43:40,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:40,655 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2024-11-12 07:43:40,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:40,655 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2024-11-12 07:43:40,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 07:43:40,657 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:40,657 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:40,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:43:40,657 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:40,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:40,658 INFO L85 PathProgramCache]: Analyzing trace with hash 911308187, now seen corresponding path program 1 times [2024-11-12 07:43:40,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:40,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076696548] [2024-11-12 07:43:40,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:40,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:43:40,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:40,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076696548] [2024-11-12 07:43:40,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076696548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:40,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:40,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:43:40,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681627613] [2024-11-12 07:43:40,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:40,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:43:40,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:40,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:43:40,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:43:40,880 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:40,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:40,912 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2024-11-12 07:43:40,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:43:40,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-12 07:43:40,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:40,914 INFO L225 Difference]: With dead ends: 282 [2024-11-12 07:43:40,914 INFO L226 Difference]: Without dead ends: 144 [2024-11-12 07:43:40,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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:43:40,915 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:40,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:43:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-12 07:43:40,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-11-12 07:43:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:43:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2024-11-12 07:43:40,932 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 158 [2024-11-12 07:43:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:40,932 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2024-11-12 07:43:40,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2024-11-12 07:43:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 07:43:40,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:40,934 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:40,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:43:40,935 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:40,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:40,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1591366557, now seen corresponding path program 1 times [2024-11-12 07:43:40,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:40,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627578260] [2024-11-12 07:43:40,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:40,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:43:41,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:41,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627578260] [2024-11-12 07:43:41,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627578260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:41,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:41,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:43:41,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974585286] [2024-11-12 07:43:41,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:41,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:43:41,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:41,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:43:41,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:43:41,155 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:41,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:41,182 INFO L93 Difference]: Finished difference Result 286 states and 413 transitions. [2024-11-12 07:43:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:43:41,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-12 07:43:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:41,185 INFO L225 Difference]: With dead ends: 286 [2024-11-12 07:43:41,185 INFO L226 Difference]: Without dead ends: 146 [2024-11-12 07:43:41,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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:43:41,187 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:41,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 575 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:43:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-12 07:43:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-11-12 07:43:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:43:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2024-11-12 07:43:41,202 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 158 [2024-11-12 07:43:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:41,203 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2024-11-12 07:43:41,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2024-11-12 07:43:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 07:43:41,205 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:41,205 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:41,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:43:41,205 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:41,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:41,206 INFO L85 PathProgramCache]: Analyzing trace with hash -928593377, now seen corresponding path program 1 times [2024-11-12 07:43:41,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:41,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313707116] [2024-11-12 07:43:41,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:41,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:43:41,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:41,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313707116] [2024-11-12 07:43:41,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313707116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:41,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:41,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:43:41,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776007718] [2024-11-12 07:43:41,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:41,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:43:41,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:41,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:43:41,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:43:41,455 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:41,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:41,483 INFO L93 Difference]: Finished difference Result 290 states and 417 transitions. [2024-11-12 07:43:41,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:43:41,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-12 07:43:41,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:41,485 INFO L225 Difference]: With dead ends: 290 [2024-11-12 07:43:41,485 INFO L226 Difference]: Without dead ends: 148 [2024-11-12 07:43:41,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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:43:41,486 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 577 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:43:41,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:43:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-12 07:43:41,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-11-12 07:43:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:43:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 210 transitions. [2024-11-12 07:43:41,498 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 210 transitions. Word has length 158 [2024-11-12 07:43:41,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:41,499 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 210 transitions. [2024-11-12 07:43:41,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 210 transitions. [2024-11-12 07:43:41,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 07:43:41,501 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:41,501 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:41,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:43:41,502 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:41,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:41,502 INFO L85 PathProgramCache]: Analyzing trace with hash -926746335, now seen corresponding path program 1 times [2024-11-12 07:43:41,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:41,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406017270] [2024-11-12 07:43:41,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:41,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-12 07:43:43,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:43,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406017270] [2024-11-12 07:43:43,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406017270] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:43:43,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751607538] [2024-11-12 07:43:43,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:43,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:43:43,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:43:43,276 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:43:43,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 07:43:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-12 07:43:43,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:43:43,780 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 15 treesize of output 1 [2024-11-12 07:43:43,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 07:43:43,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 07:43:44,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 07:43:44,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 07:43:44,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 07:43:44,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 07:43:44,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 07:43:44,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 20 [2024-11-12 07:43:44,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:43:44,486 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 36 treesize of output 23 [2024-11-12 07:43:44,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:43:44,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 26 [2024-11-12 07:43:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 233 proven. 39 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-12 07:43:44,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:43:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-12 07:43:44,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751607538] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:43:44,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 07:43:44,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-12 07:43:44,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138688249] [2024-11-12 07:43:44,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 07:43:44,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 07:43:44,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:44,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 07:43:44,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:43:44,907 INFO L87 Difference]: Start difference. First operand 147 states and 210 transitions. Second operand has 17 states, 14 states have (on average 9.785714285714286) internal successors, (137), 17 states have internal predecessors, (137), 7 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (37), 4 states have call predecessors, (37), 7 states have call successors, (37) [2024-11-12 07:43:46,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:46,196 INFO L93 Difference]: Finished difference Result 303 states and 427 transitions. [2024-11-12 07:43:46,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 07:43:46,197 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.785714285714286) internal successors, (137), 17 states have internal predecessors, (137), 7 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (37), 4 states have call predecessors, (37), 7 states have call successors, (37) Word has length 158 [2024-11-12 07:43:46,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:46,199 INFO L225 Difference]: With dead ends: 303 [2024-11-12 07:43:46,200 INFO L226 Difference]: Without dead ends: 159 [2024-11-12 07:43:46,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 342 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2024-11-12 07:43:46,202 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 722 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:46,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 449 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 07:43:46,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-12 07:43:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2024-11-12 07:43:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.3458646616541354) internal successors, (179), 133 states have internal predecessors, (179), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:43:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 215 transitions. [2024-11-12 07:43:46,214 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 215 transitions. Word has length 158 [2024-11-12 07:43:46,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:46,215 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 215 transitions. [2024-11-12 07:43:46,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.785714285714286) internal successors, (137), 17 states have internal predecessors, (137), 7 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (37), 4 states have call predecessors, (37), 7 states have call successors, (37) [2024-11-12 07:43:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 215 transitions. [2024-11-12 07:43:46,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 07:43:46,217 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:46,217 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:46,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 07:43:46,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:43:46,422 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:46,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:46,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1374076255, now seen corresponding path program 1 times [2024-11-12 07:43:46,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:46,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471173312] [2024-11-12 07:43:46,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:46,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:48,427 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:43:48,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:48,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471173312] [2024-11-12 07:43:48,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471173312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:48,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:48,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:43:48,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107218930] [2024-11-12 07:43:48,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:48,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:43:48,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:48,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:43:48,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:43:48,429 INFO L87 Difference]: Start difference. First operand 155 states and 215 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:48,896 INFO L93 Difference]: Finished difference Result 457 states and 637 transitions. [2024-11-12 07:43:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:43:48,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-12 07:43:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:48,898 INFO L225 Difference]: With dead ends: 457 [2024-11-12 07:43:48,898 INFO L226 Difference]: Without dead ends: 305 [2024-11-12 07:43:48,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:43:48,900 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 126 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:48,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 468 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:43:48,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-12 07:43:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 299. [2024-11-12 07:43:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.3515625) internal successors, (346), 256 states have internal predecessors, (346), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 07:43:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 418 transitions. [2024-11-12 07:43:48,921 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 418 transitions. Word has length 158 [2024-11-12 07:43:48,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:48,921 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 418 transitions. [2024-11-12 07:43:48,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 418 transitions. [2024-11-12 07:43:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:43:48,923 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:48,923 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:48,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 07:43:48,924 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:48,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:48,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1377135848, now seen corresponding path program 1 times [2024-11-12 07:43:48,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:48,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997332841] [2024-11-12 07:43:48,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:48,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:50,149 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:43:50,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:50,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997332841] [2024-11-12 07:43:50,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997332841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:50,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:50,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:43:50,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514464202] [2024-11-12 07:43:50,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:50,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:43:50,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:50,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:43:50,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:43:50,151 INFO L87 Difference]: Start difference. First operand 299 states and 418 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 07:43:50,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:50,941 INFO L93 Difference]: Finished difference Result 651 states and 905 transitions. [2024-11-12 07:43:50,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:43:50,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2024-11-12 07:43:50,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:50,944 INFO L225 Difference]: With dead ends: 651 [2024-11-12 07:43:50,944 INFO L226 Difference]: Without dead ends: 355 [2024-11-12 07:43:50,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:43:50,948 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 129 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:50,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 657 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:43:50,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-12 07:43:50,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 354. [2024-11-12 07:43:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 301 states have (on average 1.3388704318936877) internal successors, (403), 302 states have internal predecessors, (403), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 07:43:50,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 487 transitions. [2024-11-12 07:43:50,977 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 487 transitions. Word has length 160 [2024-11-12 07:43:50,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:50,980 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 487 transitions. [2024-11-12 07:43:50,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 07:43:50,980 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 487 transitions. [2024-11-12 07:43:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:43:50,982 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:50,982 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:50,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:43:50,982 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:50,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:50,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1963941862, now seen corresponding path program 1 times [2024-11-12 07:43:50,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:50,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373106192] [2024-11-12 07:43:50,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:50,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:43:51,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:51,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373106192] [2024-11-12 07:43:51,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373106192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:51,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:51,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:43:51,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14700137] [2024-11-12 07:43:51,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:51,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:43:51,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:51,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:43:51,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:43:51,402 INFO L87 Difference]: Start difference. First operand 354 states and 487 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:51,923 INFO L93 Difference]: Finished difference Result 928 states and 1270 transitions. [2024-11-12 07:43:51,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:43:51,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-12 07:43:51,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:51,931 INFO L225 Difference]: With dead ends: 928 [2024-11-12 07:43:51,931 INFO L226 Difference]: Without dead ends: 620 [2024-11-12 07:43:51,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:43:51,933 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 138 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:51,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 970 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:43:51,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-12 07:43:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 498. [2024-11-12 07:43:51,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 423 states have (on average 1.326241134751773) internal successors, (561), 425 states have internal predecessors, (561), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 07:43:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 681 transitions. [2024-11-12 07:43:51,971 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 681 transitions. Word has length 160 [2024-11-12 07:43:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:51,973 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 681 transitions. [2024-11-12 07:43:51,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:51,973 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 681 transitions. [2024-11-12 07:43:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:43:51,975 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:51,975 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:51,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 07:43:51,976 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:51,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:51,976 INFO L85 PathProgramCache]: Analyzing trace with hash -817488188, now seen corresponding path program 1 times [2024-11-12 07:43:51,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:51,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671482883] [2024-11-12 07:43:51,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:51,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:53,213 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:43:53,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:53,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671482883] [2024-11-12 07:43:53,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671482883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:53,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:53,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:43:53,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001101537] [2024-11-12 07:43:53,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:53,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:43:53,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:53,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:43:53,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:43:53,216 INFO L87 Difference]: Start difference. First operand 498 states and 681 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 07:43:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:53,969 INFO L93 Difference]: Finished difference Result 834 states and 1140 transitions. [2024-11-12 07:43:53,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:43:53,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2024-11-12 07:43:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:53,973 INFO L225 Difference]: With dead ends: 834 [2024-11-12 07:43:53,973 INFO L226 Difference]: Without dead ends: 658 [2024-11-12 07:43:53,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:43:53,974 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 282 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:53,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 795 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:43:53,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-12 07:43:54,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 527. [2024-11-12 07:43:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 452 states have (on average 1.334070796460177) internal successors, (603), 454 states have internal predecessors, (603), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 07:43:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 723 transitions. [2024-11-12 07:43:54,015 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 723 transitions. Word has length 160 [2024-11-12 07:43:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:54,015 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 723 transitions. [2024-11-12 07:43:54,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 07:43:54,015 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 723 transitions. [2024-11-12 07:43:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:43:54,017 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:54,017 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:54,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 07:43:54,018 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:54,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:54,018 INFO L85 PathProgramCache]: Analyzing trace with hash -115888314, now seen corresponding path program 1 times [2024-11-12 07:43:54,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:54,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942373172] [2024-11-12 07:43:54,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:54,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:43:54,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:54,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942373172] [2024-11-12 07:43:54,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942373172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:54,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:54,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:43:54,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941072608] [2024-11-12 07:43:54,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:54,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:43:54,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:54,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:43:54,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:43:54,671 INFO L87 Difference]: Start difference. First operand 527 states and 723 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:55,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:55,229 INFO L93 Difference]: Finished difference Result 903 states and 1240 transitions. [2024-11-12 07:43:55,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 07:43:55,230 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-12 07:43:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:55,236 INFO L225 Difference]: With dead ends: 903 [2024-11-12 07:43:55,236 INFO L226 Difference]: Without dead ends: 700 [2024-11-12 07:43:55,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:43:55,237 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 170 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:55,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 558 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:43:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-12 07:43:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 691. [2024-11-12 07:43:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 594 states have (on average 1.335016835016835) internal successors, (793), 596 states have internal predecessors, (793), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-12 07:43:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 949 transitions. [2024-11-12 07:43:55,286 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 949 transitions. Word has length 160 [2024-11-12 07:43:55,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:55,287 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 949 transitions. [2024-11-12 07:43:55,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 949 transitions. [2024-11-12 07:43:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-12 07:43:55,290 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:55,290 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:55,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 07:43:55,290 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:55,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:55,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1143106471, now seen corresponding path program 1 times [2024-11-12 07:43:55,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:55,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547734522] [2024-11-12 07:43:55,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:55,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:43:56,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:56,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547734522] [2024-11-12 07:43:56,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547734522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:56,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:56,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:43:56,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254399238] [2024-11-12 07:43:56,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:56,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:43:56,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:56,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:43:56,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:43:56,365 INFO L87 Difference]: Start difference. First operand 691 states and 949 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 07:43:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:57,319 INFO L93 Difference]: Finished difference Result 1414 states and 1925 transitions. [2024-11-12 07:43:57,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 07:43:57,319 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2024-11-12 07:43:57,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:57,324 INFO L225 Difference]: With dead ends: 1414 [2024-11-12 07:43:57,324 INFO L226 Difference]: Without dead ends: 769 [2024-11-12 07:43:57,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2024-11-12 07:43:57,326 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 540 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:57,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 456 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:43:57,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-12 07:43:57,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 699. [2024-11-12 07:43:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 609 states have (on average 1.3399014778325122) internal successors, (816), 611 states have internal predecessors, (816), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-12 07:43:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 952 transitions. [2024-11-12 07:43:57,376 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 952 transitions. Word has length 163 [2024-11-12 07:43:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:57,376 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 952 transitions. [2024-11-12 07:43:57,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 07:43:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 952 transitions. [2024-11-12 07:43:57,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-12 07:43:57,378 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:57,378 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:57,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 07:43:57,379 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:57,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:57,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1375006421, now seen corresponding path program 1 times [2024-11-12 07:43:57,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:57,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339457605] [2024-11-12 07:43:57,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:57,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:43:57,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:57,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339457605] [2024-11-12 07:43:57,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339457605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:57,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:57,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:43:57,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964072320] [2024-11-12 07:43:57,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:57,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:43:57,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:57,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:43:57,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:43:57,814 INFO L87 Difference]: Start difference. First operand 699 states and 952 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:58,087 INFO L93 Difference]: Finished difference Result 1360 states and 1850 transitions. [2024-11-12 07:43:58,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:43:58,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-12 07:43:58,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:58,093 INFO L225 Difference]: With dead ends: 1360 [2024-11-12 07:43:58,093 INFO L226 Difference]: Without dead ends: 699 [2024-11-12 07:43:58,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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:43:58,095 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 153 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:58,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 283 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:43:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-12 07:43:58,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 691. [2024-11-12 07:43:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 601 states have (on average 1.3311148086522462) internal successors, (800), 603 states have internal predecessors, (800), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-12 07:43:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 936 transitions. [2024-11-12 07:43:58,141 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 936 transitions. Word has length 163 [2024-11-12 07:43:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:58,141 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 936 transitions. [2024-11-12 07:43:58,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:58,141 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 936 transitions. [2024-11-12 07:43:58,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-12 07:43:58,144 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:58,144 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:58,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 07:43:58,144 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:58,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:58,145 INFO L85 PathProgramCache]: Analyzing trace with hash -694948051, now seen corresponding path program 1 times [2024-11-12 07:43:58,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:58,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143962393] [2024-11-12 07:43:58,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:58,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:43:58,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:58,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143962393] [2024-11-12 07:43:58,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143962393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:58,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:58,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:43:58,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425211440] [2024-11-12 07:43:58,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:58,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:43:58,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:58,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:43:58,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:43:58,373 INFO L87 Difference]: Start difference. First operand 691 states and 936 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:58,430 INFO L93 Difference]: Finished difference Result 1356 states and 1834 transitions. [2024-11-12 07:43:58,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:43:58,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-12 07:43:58,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:58,435 INFO L225 Difference]: With dead ends: 1356 [2024-11-12 07:43:58,435 INFO L226 Difference]: Without dead ends: 699 [2024-11-12 07:43:58,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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:43:58,437 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:58,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 760 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:43:58,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-12 07:43:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-12 07:43:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 609 states have (on average 1.3201970443349753) internal successors, (804), 611 states have internal predecessors, (804), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-12 07:43:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 940 transitions. [2024-11-12 07:43:58,485 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 940 transitions. Word has length 163 [2024-11-12 07:43:58,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:58,486 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 940 transitions. [2024-11-12 07:43:58,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:43:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 940 transitions. [2024-11-12 07:43:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-12 07:43:58,488 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:58,488 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:58,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 07:43:58,489 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:58,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1729912485, now seen corresponding path program 1 times [2024-11-12 07:43:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:58,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946712966] [2024-11-12 07:43:58,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:58,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:43:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:43:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:43:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:43:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:43:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:43:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:43:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:43:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:43:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:43:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:43:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:43:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:43:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:43:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:43:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:43:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:43:59,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:59,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946712966] [2024-11-12 07:43:59,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946712966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:59,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:59,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:43:59,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272332604] [2024-11-12 07:43:59,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:59,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:43:59,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:59,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:43:59,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:43:59,918 INFO L87 Difference]: Start difference. First operand 699 states and 940 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 07:44:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:00,491 INFO L93 Difference]: Finished difference Result 713 states and 957 transitions. [2024-11-12 07:44:00,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:44:00,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2024-11-12 07:44:00,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:00,495 INFO L225 Difference]: With dead ends: 713 [2024-11-12 07:44:00,495 INFO L226 Difference]: Without dead ends: 711 [2024-11-12 07:44:00,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:44:00,496 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 106 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:00,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 567 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:44:00,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-12 07:44:00,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2024-11-12 07:44:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 621 states have (on average 1.3140096618357489) internal successors, (816), 623 states have internal predecessors, (816), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-12 07:44:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 952 transitions. [2024-11-12 07:44:00,551 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 952 transitions. Word has length 163 [2024-11-12 07:44:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:00,553 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 952 transitions. [2024-11-12 07:44:00,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 07:44:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 952 transitions. [2024-11-12 07:44:00,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-12 07:44:00,555 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:00,555 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 07:44:00,556 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:00,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1731759527, now seen corresponding path program 1 times [2024-11-12 07:44:00,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:00,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334535632] [2024-11-12 07:44:00,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:00,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:44:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:44:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:44:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:44:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:44:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:44:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:44:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:44:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:44:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:44:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:44:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:44:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:44:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:44:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:44:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:44:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:44:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:44:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:44:00,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:44:00,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334535632] [2024-11-12 07:44:00,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334535632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:00,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:00,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:44:00,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233953720] [2024-11-12 07:44:00,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:00,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:44:00,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:44:00,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:44:00,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:44:00,964 INFO L87 Difference]: Start difference. First operand 711 states and 952 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:44:01,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:01,209 INFO L93 Difference]: Finished difference Result 1376 states and 1842 transitions. [2024-11-12 07:44:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:44:01,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-12 07:44:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:01,217 INFO L225 Difference]: With dead ends: 1376 [2024-11-12 07:44:01,217 INFO L226 Difference]: Without dead ends: 711 [2024-11-12 07:44:01,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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:01,220 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 126 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:01,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 338 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:44:01,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-12 07:44:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2024-11-12 07:44:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 621 states have (on average 1.3075684380032206) internal successors, (812), 623 states have internal predecessors, (812), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-12 07:44:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 948 transitions. [2024-11-12 07:44:01,274 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 948 transitions. Word has length 163 [2024-11-12 07:44:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:01,274 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 948 transitions. [2024-11-12 07:44:01,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:44:01,275 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 948 transitions. [2024-11-12 07:44:01,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 07:44:01,277 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:01,278 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 07:44:01,278 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:01,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:01,278 INFO L85 PathProgramCache]: Analyzing trace with hash 714531706, now seen corresponding path program 1 times [2024-11-12 07:44:01,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:01,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930275640] [2024-11-12 07:44:01,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:01,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:44:01,389 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:44:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:44:01,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:44:01,553 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:44:01,554 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:44:01,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 07:44:01,559 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:44:01,650 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:44:01,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:44:01 BoogieIcfgContainer [2024-11-12 07:44:01,653 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:44:01,653 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:44:01,654 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:44:01,655 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:44:01,655 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:43:38" (3/4) ... [2024-11-12 07:44:01,658 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:44:01,659 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:44:01,659 INFO L158 Benchmark]: Toolchain (without parser) took 24905.04ms. Allocated memory was 138.4MB in the beginning and 746.6MB in the end (delta: 608.2MB). Free memory was 102.1MB in the beginning and 367.7MB in the end (delta: -265.6MB). Peak memory consumption was 342.4MB. Max. memory is 16.1GB. [2024-11-12 07:44:01,659 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory was 111.1MB in the beginning and 111.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:44:01,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.05ms. Allocated memory is still 138.4MB. Free memory was 102.1MB in the beginning and 81.4MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 07:44:01,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.11ms. Allocated memory is still 138.4MB. Free memory was 81.0MB in the beginning and 76.8MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:44:01,660 INFO L158 Benchmark]: Boogie Preprocessor took 72.61ms. Allocated memory is still 138.4MB. Free memory was 76.8MB in the beginning and 72.2MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 07:44:01,661 INFO L158 Benchmark]: RCFGBuilder took 1254.19ms. Allocated memory is still 138.4MB. Free memory was 71.8MB in the beginning and 76.4MB in the end (delta: -4.6MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-11-12 07:44:01,662 INFO L158 Benchmark]: TraceAbstraction took 23140.06ms. Allocated memory was 138.4MB in the beginning and 746.6MB in the end (delta: 608.2MB). Free memory was 75.9MB in the beginning and 367.7MB in the end (delta: -291.8MB). Peak memory consumption was 318.0MB. Max. memory is 16.1GB. [2024-11-12 07:44:01,662 INFO L158 Benchmark]: Witness Printer took 5.35ms. Allocated memory is still 746.6MB. Free memory is still 367.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:44:01,666 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.19ms. Allocated memory is still 138.4MB. Free memory was 111.1MB in the beginning and 111.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.05ms. Allocated memory is still 138.4MB. Free memory was 102.1MB in the beginning and 81.4MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.11ms. Allocated memory is still 138.4MB. Free memory was 81.0MB in the beginning and 76.8MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.61ms. Allocated memory is still 138.4MB. Free memory was 76.8MB in the beginning and 72.2MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1254.19ms. Allocated memory is still 138.4MB. Free memory was 71.8MB in the beginning and 76.4MB in the end (delta: -4.6MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * TraceAbstraction took 23140.06ms. Allocated memory was 138.4MB in the beginning and 746.6MB in the end (delta: 608.2MB). Free memory was 75.9MB in the beginning and 367.7MB in the end (delta: -291.8MB). Peak memory consumption was 318.0MB. Max. memory is 16.1GB. * Witness Printer took 5.35ms. Allocated memory is still 746.6MB. Free memory is still 367.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 119. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 8.3, 2.25, 10.3, 0, 128, 9.8, 1, 32, -10, 16, 25, 1, 0, 32, 256, 16, 0 }; [L63] signed short int last_1_WrapperStruct00_var_1_21 = 256; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_21=256] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L116] EXPR WrapperStruct00.var_1_21 [L116] last_1_WrapperStruct00_var_1_21 = WrapperStruct00.var_1_21 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L85] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L86] EXPR WrapperStruct00.var_1_2 [L86] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L86] EXPR WrapperStruct00.var_1_2 [L86] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L86] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L86] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L86] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L87] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_3 [L88] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_3 [L88] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L88] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L88] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L88] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L89] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_4 [L90] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_4 [L90] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L90] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [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_21=256] [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_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L94] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L95] EXPR WrapperStruct00.var_1_8 [L95] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_8 [L95] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L95] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L96] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ulong() [L97] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L98] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L99] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L100] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L102] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L105] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L106] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 31) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L108] WrapperStruct00.var_1_19 = __VERIFIER_nondet_char() [L109] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L111] WrapperStruct00.var_1_20 = __VERIFIER_nondet_char() [L112] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L127] RET updateVariables() [L128] CALL step() [L67] EXPR WrapperStruct00.var_1_14 [L67] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_14 [L68] WrapperStruct00.var_1_21 = last_1_WrapperStruct00_var_1_21 [L69] EXPR WrapperStruct00.var_1_16 [L69] WrapperStruct00.var_1_22 = WrapperStruct00.var_1_16 [L70] EXPR WrapperStruct00.var_1_6 [L70] WrapperStruct00.var_1_23 = WrapperStruct00.var_1_6 [L71] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L71] EXPR ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L71] EXPR WrapperStruct00.var_1_3 [L71] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L71] COND FALSE !(((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) [L74] EXPR WrapperStruct00.var_1_22 [L74] signed char stepLocal_0 = WrapperStruct00.var_1_22; [L75] EXPR WrapperStruct00.var_1_22 [L75] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=20] [L75] EXPR ((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21) [L75] EXPR WrapperStruct00.var_1_22 [L75] EXPR ((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=20] [L75] COND FALSE !(stepLocal_0 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) [L78] EXPR WrapperStruct00.var_1_4 [L78] EXPR WrapperStruct00.var_1_2 [L78] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L78] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L78] EXPR WrapperStruct00.var_1_2 [L78] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L78] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L78] COND FALSE !(WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) [L81] EXPR WrapperStruct00.var_1_22 [L81] WrapperStruct00.var_1_7 = WrapperStruct00.var_1_22 [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR WrapperStruct00.var_1_3 [L119] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))) [L119] EXPR WrapperStruct00.var_1_4 [L119] EXPR WrapperStruct00.var_1_2 [L119] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L119] EXPR WrapperStruct00.var_1_2 [L119] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)) [L119] EXPR WrapperStruct00.var_1_7 [L119] EXPR WrapperStruct00.var_1_22 [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15) [L119] EXPR WrapperStruct00.var_1_22 [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))) [L119] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_23 == ((unsigned char) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119-L120] return (((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_23 == ((unsigned char) WrapperStruct00.var_1_6)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.0s, OverallIterations: 19, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2502 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2496 mSDsluCounter, 9953 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7043 mSDsCounter, 346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5387 IncrementalHoareTripleChecker+Invalid, 5733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 346 mSolverCounterUnsat, 2910 mSDtfsCounter, 5387 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1189 GetRequests, 1060 SyntacticMatches, 10 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=711occurred in iteration=17, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 355 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 3196 NumberOfCodeBlocks, 3196 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3167 ConstructedInterpolants, 0 QuantifiedInterpolants, 9622 SizeOfPredicates, 4 NumberOfNonLiveVariables, 582 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 12123/12240 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:44:01,699 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-63.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 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:44:03,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:44:03,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:44:03,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:44:03,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:44:03,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:44:03,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:44:03,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:44:03,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:44:03,989 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:44:03,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:44:03,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:44:03,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:44:03,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:44:03,991 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:44:03,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:44:03,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:44:03,992 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:44:03,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:44:03,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:44:03,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:44:03,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:44:03,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:44:03,994 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:44:03,995 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:44:03,995 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:44:03,995 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:44:03,995 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:44:03,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:44:03,996 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:44:03,996 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:44:03,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:44:03,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:44:03,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:44:03,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:44:03,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:44:03,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:44:03,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:44:03,998 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:44:03,998 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:44:03,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:44:04,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:44:04,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:44:04,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:44:04,002 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 -> 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 [2024-11-12 07:44:04,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:44:04,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:44:04,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:44:04,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:44:04,331 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:44:04,332 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-63.i [2024-11-12 07:44:05,855 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:44:06,090 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:44:06,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i [2024-11-12 07:44:06,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ce02c793/3dca69d15c634687829fcca446a84e93/FLAG080015990 [2024-11-12 07:44:06,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ce02c793/3dca69d15c634687829fcca446a84e93 [2024-11-12 07:44:06,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:44:06,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:44:06,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:44:06,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:44:06,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:44:06,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:44:06" (1/1) ... [2024-11-12 07:44:06,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b1c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:06, skipping insertion in model container [2024-11-12 07:44:06,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:44:06" (1/1) ... [2024-11-12 07:44:06,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:44:06,681 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-63.i[916,929] [2024-11-12 07:44:06,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:44:06,791 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:44:06,803 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-63.i[916,929] [2024-11-12 07:44:06,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:44:06,896 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:44:06,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:06 WrapperNode [2024-11-12 07:44:06,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:44:06,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:44:06,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:44:06,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:44:06,904 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:06" (1/1) ... [2024-11-12 07:44:06,927 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:06" (1/1) ... [2024-11-12 07:44:06,982 INFO L138 Inliner]: procedures = 37, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 655 [2024-11-12 07:44:06,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:44:06,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:44:06,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:44:06,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:44:06,996 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:06" (1/1) ... [2024-11-12 07:44:06,996 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:06" (1/1) ... [2024-11-12 07:44:07,009 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:06" (1/1) ... [2024-11-12 07:44:07,045 INFO L175 MemorySlicer]: Split 175 memory accesses to 2 slices as follows [2, 173]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 38 writes are split as follows [0, 38]. [2024-11-12 07:44:07,045 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:06" (1/1) ... [2024-11-12 07:44:07,045 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:06" (1/1) ... [2024-11-12 07:44:07,097 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:06" (1/1) ... [2024-11-12 07:44:07,105 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:06" (1/1) ... [2024-11-12 07:44:07,112 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:06" (1/1) ... [2024-11-12 07:44:07,115 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:06" (1/1) ... [2024-11-12 07:44:07,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:44:07,121 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:44:07,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:44:07,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:44:07,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:06" (1/1) ... [2024-11-12 07:44:07,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:44:07,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:44:07,164 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:07,168 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:07,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:44:07,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:44:07,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:44:07,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:44:07,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:44:07,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-12 07:44:07,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-12 07:44:07,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:44:07,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:44:07,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:44:07,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:44:07,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-12 07:44:07,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-12 07:44:07,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-12 07:44:07,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-12 07:44:07,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-12 07:44:07,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-12 07:44:07,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-12 07:44:07,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-12 07:44:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:44:07,213 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:44:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-12 07:44:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-12 07:44:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:44:07,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:44:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:44:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:44:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:44:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:44:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:44:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:44:07,397 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:44:07,399 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:44:09,469 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-12 07:44:09,469 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:44:09,486 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:44:09,487 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:44:09,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:44:09 BoogieIcfgContainer [2024-11-12 07:44:09,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:44:09,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:44:09,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:44:09,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:44:09,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:44:06" (1/3) ... [2024-11-12 07:44:09,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a0de88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:44:09, skipping insertion in model container [2024-11-12 07:44:09,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:06" (2/3) ... [2024-11-12 07:44:09,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a0de88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:44:09, skipping insertion in model container [2024-11-12 07:44:09,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:44:09" (3/3) ... [2024-11-12 07:44:09,500 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-63.i [2024-11-12 07:44:09,516 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:44:09,516 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:44:09,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:44:09,583 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;@2122b8b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:44:09,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:44:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:44:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-12 07:44:09,598 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:09,599 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:09,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:09,603 INFO L85 PathProgramCache]: Analyzing trace with hash -16098142, now seen corresponding path program 1 times [2024-11-12 07:44:09,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:09,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825231138] [2024-11-12 07:44:09,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:09,615 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:44:09,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:09,617 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:44:09,618 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:44:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:10,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:44:10,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:44:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-12 07:44:10,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:44:10,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:44:10,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825231138] [2024-11-12 07:44:10,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825231138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:10,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:10,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:44:10,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88430792] [2024-11-12 07:44:10,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:10,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:44:10,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:44:10,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:44:10,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:44:10,186 INFO L87 Difference]: Start difference. First operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 07:44:10,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:10,222 INFO L93 Difference]: Finished difference Result 271 states and 422 transitions. [2024-11-12 07:44:10,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:44:10,225 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-12 07:44:10,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:10,234 INFO L225 Difference]: With dead ends: 271 [2024-11-12 07:44:10,235 INFO L226 Difference]: Without dead ends: 135 [2024-11-12 07:44:10,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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:10,246 INFO L435 NwaCegarLoop]: 198 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, 198 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:10,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 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:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-12 07:44:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-12 07:44:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:44:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-12 07:44:10,291 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2024-11-12 07:44:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:10,292 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-12 07:44:10,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 07:44:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-12 07:44:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-12 07:44:10,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:10,295 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 07:44:10,501 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:44:10,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:10,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:10,504 INFO L85 PathProgramCache]: Analyzing trace with hash 413675062, now seen corresponding path program 1 times [2024-11-12 07:44:10,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:10,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421499956] [2024-11-12 07:44:10,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:10,505 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:44:10,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:10,519 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:44:10,520 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:44:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:11,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:44:11,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:44:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:44:11,085 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:44:11,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:44:11,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421499956] [2024-11-12 07:44:11,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421499956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:11,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:11,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:44:11,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948647508] [2024-11-12 07:44:11,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:11,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:44:11,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:44:11,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:44:11,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:44:11,091 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:44:11,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:11,165 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2024-11-12 07:44:11,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:44:11,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-12 07:44:11,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:11,170 INFO L225 Difference]: With dead ends: 269 [2024-11-12 07:44:11,170 INFO L226 Difference]: Without dead ends: 137 [2024-11-12 07:44:11,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 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:11,172 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 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:11,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 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:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-12 07:44:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-12 07:44:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:44:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-12 07:44:11,185 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2024-11-12 07:44:11,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:11,186 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-12 07:44:11,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:44:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-12 07:44:11,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 07:44:11,190 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:11,190 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 07:44:11,390 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:44:11,391 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:11,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:11,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1261194609, now seen corresponding path program 1 times [2024-11-12 07:44:11,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:11,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382093582] [2024-11-12 07:44:11,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:11,393 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:44:11,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:11,394 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:44:11,395 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:44:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:11,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:44:11,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:44:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:44:11,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:44:11,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:44:11,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382093582] [2024-11-12 07:44:11,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382093582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:11,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:11,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:44:11,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471203365] [2024-11-12 07:44:11,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:11,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:44:11,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:44:11,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:44:11,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:44:11,884 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:44:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:11,950 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2024-11-12 07:44:11,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:44:11,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-12 07:44:11,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:11,953 INFO L225 Difference]: With dead ends: 274 [2024-11-12 07:44:11,953 INFO L226 Difference]: Without dead ends: 140 [2024-11-12 07:44:11,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 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:11,959 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:11,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:44:11,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-12 07:44:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-11-12 07:44:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:44:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2024-11-12 07:44:11,982 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 158 [2024-11-12 07:44:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:11,987 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2024-11-12 07:44:11,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:44:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2024-11-12 07:44:11,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 07:44:11,993 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:11,994 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,041 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:44:12,196 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:44:12,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:12,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:12,198 INFO L85 PathProgramCache]: Analyzing trace with hash 674388595, now seen corresponding path program 1 times [2024-11-12 07:44:12,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:12,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672406575] [2024-11-12 07:44:12,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:12,199 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:44:12,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:12,202 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:44:12,205 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:44:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:12,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 07:44:12,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:44:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:44:12,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:44:12,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:44:12,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672406575] [2024-11-12 07:44:12,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672406575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:12,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:12,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:44:12,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048836914] [2024-11-12 07:44:12,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:12,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:44:12,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:44:12,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:44:12,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:44:12,712 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:44:12,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:12,788 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2024-11-12 07:44:12,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:44:12,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-12 07:44:12,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:12,791 INFO L225 Difference]: With dead ends: 280 [2024-11-12 07:44:12,791 INFO L226 Difference]: Without dead ends: 144 [2024-11-12 07:44:12,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:44:12,793 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:12,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 935 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:44:12,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-12 07:44:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-11-12 07:44:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:44:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2024-11-12 07:44:12,804 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 158 [2024-11-12 07:44:12,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:12,805 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2024-11-12 07:44:12,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:44:12,805 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2024-11-12 07:44:12,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 07:44:12,807 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:12,807 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,826 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:44:13,007 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:44:13,008 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:13,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:13,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1354446965, now seen corresponding path program 1 times [2024-11-12 07:44:13,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:13,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700464621] [2024-11-12 07:44:13,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:13,009 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:44:13,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:13,011 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:44:13,012 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:44:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:13,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 07:44:13,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:44:13,561 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:44:13,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:44:13,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:44:13,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700464621] [2024-11-12 07:44:13,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700464621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:13,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:13,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:44:13,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849661046] [2024-11-12 07:44:13,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:13,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:44:13,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:44:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:44:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:44:13,570 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:44:13,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:13,661 INFO L93 Difference]: Finished difference Result 286 states and 413 transitions. [2024-11-12 07:44:13,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:44:13,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-12 07:44:13,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:13,664 INFO L225 Difference]: With dead ends: 286 [2024-11-12 07:44:13,665 INFO L226 Difference]: Without dead ends: 146 [2024-11-12 07:44:13,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:44:13,666 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 1 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:13,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1110 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:44:13,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-12 07:44:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-11-12 07:44:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:44:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2024-11-12 07:44:13,682 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 158 [2024-11-12 07:44:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:13,683 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2024-11-12 07:44:13,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:44:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2024-11-12 07:44:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 07:44:13,685 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:13,685 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,703 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:44:13,886 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:44:13,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:13,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1165512969, now seen corresponding path program 1 times [2024-11-12 07:44:13,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:13,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913074924] [2024-11-12 07:44:13,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:13,888 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:44:13,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:13,889 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:44:13,890 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:44:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:14,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 07:44:14,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:44:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 07:44:14,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:44:14,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:44:14,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913074924] [2024-11-12 07:44:14,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913074924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:14,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:14,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:44:14,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649889246] [2024-11-12 07:44:14,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:14,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:44:14,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:44:14,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:44:14,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:44:14,411 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:44:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:14,515 INFO L93 Difference]: Finished difference Result 290 states and 417 transitions. [2024-11-12 07:44:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:44:14,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-12 07:44:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:14,518 INFO L225 Difference]: With dead ends: 290 [2024-11-12 07:44:14,518 INFO L226 Difference]: Without dead ends: 148 [2024-11-12 07:44:14,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:44:14,519 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 1 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:14,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1287 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:44:14,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-12 07:44:14,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-11-12 07:44:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:44:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 210 transitions. [2024-11-12 07:44:14,536 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 210 transitions. Word has length 158 [2024-11-12 07:44:14,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:14,539 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 210 transitions. [2024-11-12 07:44:14,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 07:44:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 210 transitions. [2024-11-12 07:44:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 07:44:14,541 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:14,541 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,559 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:44:14,741 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:44:14,742 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:14,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:14,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1163665927, now seen corresponding path program 1 times [2024-11-12 07:44:14,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:14,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119302249] [2024-11-12 07:44:14,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:14,743 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:44:14,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:14,744 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:44:14,745 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:44:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:15,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 07:44:15,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:44:15,358 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:44:15,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-12 07:44:15,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-12 07:44:15,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-12 07:44:15,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-12 07:44:15,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:44:15,721 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 41 treesize of output 28 [2024-11-12 07:44:15,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:44:15,828 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 41 treesize of output 28 [2024-11-12 07:44:15,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:44:15,938 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 36 treesize of output 38 [2024-11-12 07:44:16,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:44:16,181 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 88 treesize of output 72 [2024-11-12 07:44:16,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:44:16,505 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 87 treesize of output 89 [2024-11-12 07:44:16,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:44:16,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 110 treesize of output 44 [2024-11-12 07:44:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 441 proven. 39 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-12 07:44:16,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:44:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-12 07:44:17,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:44:17,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119302249] [2024-11-12 07:44:17,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119302249] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:44:17,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:44:17,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2024-11-12 07:44:17,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132180022] [2024-11-12 07:44:17,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:44:17,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 07:44:17,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:44:17,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 07:44:17,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:44:17,158 INFO L87 Difference]: Start difference. First operand 147 states and 210 transitions. Second operand has 15 states, 13 states have (on average 8.538461538461538) internal successors, (111), 15 states have internal predecessors, (111), 6 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-12 07:44:22,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:22,576 INFO L93 Difference]: Finished difference Result 394 states and 547 transitions. [2024-11-12 07:44:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 07:44:22,579 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 8.538461538461538) internal successors, (111), 15 states have internal predecessors, (111), 6 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) Word has length 158 [2024-11-12 07:44:22,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:22,581 INFO L225 Difference]: With dead ends: 394 [2024-11-12 07:44:22,581 INFO L226 Difference]: Without dead ends: 250 [2024-11-12 07:44:22,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=326, Invalid=934, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 07:44:22,583 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 721 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:22,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 480 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-12 07:44:22,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-12 07:44:22,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 163. [2024-11-12 07:44:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 139 states have (on average 1.330935251798561) internal successors, (185), 139 states have internal predecessors, (185), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:44:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 221 transitions. [2024-11-12 07:44:22,599 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 221 transitions. Word has length 158 [2024-11-12 07:44:22,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:22,599 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 221 transitions. [2024-11-12 07:44:22,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 8.538461538461538) internal successors, (111), 15 states have internal predecessors, (111), 6 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-12 07:44:22,600 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 221 transitions. [2024-11-12 07:44:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 07:44:22,601 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:22,601 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,618 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 (8)] Forceful destruction successful, exit code 0 [2024-11-12 07:44:22,802 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:44:22,802 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:22,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:22,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1137156663, now seen corresponding path program 1 times [2024-11-12 07:44:22,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:22,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725082449] [2024-11-12 07:44:22,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:22,803 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:44:22,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:22,805 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:44:22,805 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:44:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:23,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-12 07:44:23,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:44:23,440 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 98 treesize of output 97 [2024-11-12 07:44:23,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 172 [2024-11-12 07:44:24,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 172 [2024-11-12 07:44:24,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 172 [2024-11-12 07:44:25,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 167 [2024-11-12 07:44:26,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 172 [2024-11-12 07:44:26,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 172 [2024-11-12 07:44:27,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 172 [2024-11-12 07:44:27,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 172 [2024-11-12 07:44:28,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 167 [2024-11-12 07:44:29,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 169 [2024-11-12 07:44:29,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 169 [2024-11-12 07:44:30,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 202 [2024-11-12 07:44:31,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 170 [2024-11-12 07:44:32,189 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 221 treesize of output 187 [2024-11-12 07:44:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 308 proven. 63 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-12 07:44:32,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:44:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-12 07:44:34,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:44:34,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725082449] [2024-11-12 07:44:34,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725082449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:44:34,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:44:34,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2024-11-12 07:44:34,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127647109] [2024-11-12 07:44:34,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:44:34,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 07:44:34,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:44:34,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 07:44:34,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:44:34,383 INFO L87 Difference]: Start difference. First operand 163 states and 221 transitions. Second operand has 22 states, 20 states have (on average 6.95) internal successors, (139), 22 states have internal predecessors, (139), 8 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36)