./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.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-sp_file-33.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 9fba8bcd82b4a3fe57500a406293d5d51cfc2c8d1877a7a6552e09538ec18fb3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:50:58,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:50:58,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:50:58,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:50:58,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:50:58,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:50:58,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:50:58,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:50:58,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:50:58,576 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:50:58,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:50:58,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:50:58,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:50:58,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:50:58,578 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:50:58,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:50:58,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:50:58,579 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:50:58,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:50:58,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:50:58,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:50:58,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:50:58,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:50:58,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:50:58,582 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:50:58,582 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:50:58,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:50:58,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:50:58,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:50:58,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:50:58,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:50:58,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:50:58,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:50:58,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:50:58,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:50:58,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:50:58,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:50:58,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:50:58,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:50:58,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:50:58,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:50:58,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:50:58,587 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 -> 9fba8bcd82b4a3fe57500a406293d5d51cfc2c8d1877a7a6552e09538ec18fb3 [2024-11-12 07:50:58,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:50:58,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:50:58,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:50:58,823 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:50:58,823 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:50:58,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i [2024-11-12 07:51:00,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:51:00,340 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:51:00,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i [2024-11-12 07:51:00,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/080f11234/8d3a450c45e34b8e8e0cda881a27358f/FLAG33e7bbf99 [2024-11-12 07:51:00,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/080f11234/8d3a450c45e34b8e8e0cda881a27358f [2024-11-12 07:51:00,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:51:00,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:51:00,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:51:00,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:51:00,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:51:00,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:51:00" (1/1) ... [2024-11-12 07:51:00,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47dc8459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:00, skipping insertion in model container [2024-11-12 07:51:00,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:51:00" (1/1) ... [2024-11-12 07:51:00,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:51:00,547 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-sp_file-33.i[917,930] [2024-11-12 07:51:00,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:51:00,596 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:51:00,634 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-sp_file-33.i[917,930] [2024-11-12 07:51:00,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:51:00,702 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:51:00,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:00 WrapperNode [2024-11-12 07:51:00,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:51:00,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:51:00,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:51:00,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:51:00,709 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:51:00" (1/1) ... [2024-11-12 07:51:00,726 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:51:00" (1/1) ... [2024-11-12 07:51:00,767 INFO L138 Inliner]: procedures = 30, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 478 [2024-11-12 07:51:00,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:51:00,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:51:00,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:51:00,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:51:00,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:00" (1/1) ... [2024-11-12 07:51:00,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:00" (1/1) ... [2024-11-12 07:51:00,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:00" (1/1) ... [2024-11-12 07:51:00,807 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-12 07:51:00,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:00" (1/1) ... [2024-11-12 07:51:00,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:00" (1/1) ... [2024-11-12 07:51:00,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:00" (1/1) ... [2024-11-12 07:51:00,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:00" (1/1) ... [2024-11-12 07:51:00,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:00" (1/1) ... [2024-11-12 07:51:00,836 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:00" (1/1) ... [2024-11-12 07:51:00,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:51:00,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:51:00,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:51:00,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:51:00,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:00" (1/1) ... [2024-11-12 07:51:00,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:51:00,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:51:00,881 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:51:00,883 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:51:00,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:51:00,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-12 07:51:00,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-12 07:51:00,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-12 07:51:00,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 07:51:00,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-12 07:51:00,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 07:51:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:51:00,919 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:51:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 07:51:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:51:00,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:51:01,034 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:51:01,035 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:51:01,465 INFO L? ?]: Removed 138 outVars from TransFormulas that were not future-live. [2024-11-12 07:51:01,465 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:51:01,483 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:51:01,484 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:51:01,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:51:01 BoogieIcfgContainer [2024-11-12 07:51:01,487 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:51:01,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:51:01,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:51:01,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:51:01,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:51:00" (1/3) ... [2024-11-12 07:51:01,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0f4b8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:51:01, skipping insertion in model container [2024-11-12 07:51:01,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:00" (2/3) ... [2024-11-12 07:51:01,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0f4b8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:51:01, skipping insertion in model container [2024-11-12 07:51:01,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:51:01" (3/3) ... [2024-11-12 07:51:01,495 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-33.i [2024-11-12 07:51:01,509 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:51:01,509 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:51:01,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:51:01,566 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;@2ec5380b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:51:01,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:51:01,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:51:01,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 07:51:01,577 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:01,577 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:01,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:01,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:01,582 INFO L85 PathProgramCache]: Analyzing trace with hash 507444683, now seen corresponding path program 1 times [2024-11-12 07:51:01,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:01,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647998350] [2024-11-12 07:51:01,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:01,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:01,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:01,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:01,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:01,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:01,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:01,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:01,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:01,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:01,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:01,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:01,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647998350] [2024-11-12 07:51:01,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647998350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:01,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:01,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:51:01,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718445543] [2024-11-12 07:51:01,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:01,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:51:01,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:01,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:51:01,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:51:01,954 INFO L87 Difference]: Start difference. First operand has 107 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:02,047 INFO L93 Difference]: Finished difference Result 207 states and 319 transitions. [2024-11-12 07:51:02,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:51:02,049 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2024-11-12 07:51:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:02,055 INFO L225 Difference]: With dead ends: 207 [2024-11-12 07:51:02,055 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 07:51:02,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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:51:02,060 INFO L435 NwaCegarLoop]: 151 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, 151 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:51:02,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:51:02,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 07:51:02,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-12 07:51:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:51:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2024-11-12 07:51:02,098 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 98 [2024-11-12 07:51:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:02,099 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2024-11-12 07:51:02,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2024-11-12 07:51:02,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 07:51:02,102 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:02,102 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:02,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:51:02,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:02,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:02,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1582582707, now seen corresponding path program 1 times [2024-11-12 07:51:02,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:02,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276988851] [2024-11-12 07:51:02,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:02,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:02,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:02,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276988851] [2024-11-12 07:51:02,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276988851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:02,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:02,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:51:02,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476761918] [2024-11-12 07:51:02,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:02,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:51:02,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:02,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:51:02,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:51:02,433 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:02,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:02,487 INFO L93 Difference]: Finished difference Result 206 states and 303 transitions. [2024-11-12 07:51:02,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:51:02,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-12 07:51:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:02,491 INFO L225 Difference]: With dead ends: 206 [2024-11-12 07:51:02,491 INFO L226 Difference]: Without dead ends: 106 [2024-11-12 07:51:02,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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:51:02,492 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 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:51:02,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:51:02,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-12 07:51:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-12 07:51:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:51:02,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2024-11-12 07:51:02,509 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 98 [2024-11-12 07:51:02,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:02,512 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2024-11-12 07:51:02,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2024-11-12 07:51:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 07:51:02,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:02,515 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:02,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:51:02,515 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:02,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:02,516 INFO L85 PathProgramCache]: Analyzing trace with hash 192424655, now seen corresponding path program 1 times [2024-11-12 07:51:02,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:02,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348681303] [2024-11-12 07:51:02,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:02,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:02,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:02,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348681303] [2024-11-12 07:51:02,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348681303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:02,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:02,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:51:02,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300686150] [2024-11-12 07:51:02,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:02,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:51:02,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:02,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:51:02,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:51:02,724 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:02,756 INFO L93 Difference]: Finished difference Result 210 states and 307 transitions. [2024-11-12 07:51:02,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:51:02,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-12 07:51:02,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:02,761 INFO L225 Difference]: With dead ends: 210 [2024-11-12 07:51:02,761 INFO L226 Difference]: Without dead ends: 108 [2024-11-12 07:51:02,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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:51:02,762 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 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:51:02,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:51:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-12 07:51:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-12 07:51:02,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 96 states have internal predecessors, (137), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:51:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2024-11-12 07:51:02,773 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 98 [2024-11-12 07:51:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:02,776 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2024-11-12 07:51:02,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2024-11-12 07:51:02,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 07:51:02,777 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:02,777 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:02,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:51:02,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:02,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:02,779 INFO L85 PathProgramCache]: Analyzing trace with hash 194271697, now seen corresponding path program 1 times [2024-11-12 07:51:02,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:02,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613373275] [2024-11-12 07:51:02,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:02,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:03,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:03,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613373275] [2024-11-12 07:51:03,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613373275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:03,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:03,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:51:03,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306994083] [2024-11-12 07:51:03,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:03,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:51:03,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:03,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:51:03,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:51:03,058 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:03,197 INFO L93 Difference]: Finished difference Result 268 states and 389 transitions. [2024-11-12 07:51:03,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:51:03,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-12 07:51:03,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:03,199 INFO L225 Difference]: With dead ends: 268 [2024-11-12 07:51:03,199 INFO L226 Difference]: Without dead ends: 164 [2024-11-12 07:51:03,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 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:51:03,201 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 68 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:03,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 512 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:51:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-12 07:51:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 124. [2024-11-12 07:51:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 113 states have (on average 1.4424778761061947) internal successors, (163), 113 states have internal predecessors, (163), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:51:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 181 transitions. [2024-11-12 07:51:03,207 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 181 transitions. Word has length 98 [2024-11-12 07:51:03,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:03,207 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 181 transitions. [2024-11-12 07:51:03,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2024-11-12 07:51:03,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 07:51:03,208 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:03,209 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:03,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:51:03,209 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:03,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:03,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1085591981, now seen corresponding path program 1 times [2024-11-12 07:51:03,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:03,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563321988] [2024-11-12 07:51:03,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:03,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:03,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:03,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563321988] [2024-11-12 07:51:03,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563321988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:03,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:03,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:51:03,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246648018] [2024-11-12 07:51:03,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:03,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:51:03,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:03,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:51:03,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:51:03,809 INFO L87 Difference]: Start difference. First operand 124 states and 181 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:04,090 INFO L93 Difference]: Finished difference Result 287 states and 417 transitions. [2024-11-12 07:51:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:51:04,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-12 07:51:04,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:04,092 INFO L225 Difference]: With dead ends: 287 [2024-11-12 07:51:04,092 INFO L226 Difference]: Without dead ends: 166 [2024-11-12 07:51:04,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:51:04,094 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 186 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:04,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 703 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:51:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-12 07:51:04,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 126. [2024-11-12 07:51:04,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 115 states have (on average 1.434782608695652) internal successors, (165), 115 states have internal predecessors, (165), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:51:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 183 transitions. [2024-11-12 07:51:04,108 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 183 transitions. Word has length 98 [2024-11-12 07:51:04,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:04,108 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 183 transitions. [2024-11-12 07:51:04,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:04,108 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 183 transitions. [2024-11-12 07:51:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 07:51:04,110 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:04,110 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:04,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:51:04,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:04,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:04,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1611166637, now seen corresponding path program 1 times [2024-11-12 07:51:04,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:04,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740648610] [2024-11-12 07:51:04,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:04,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:04,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:04,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:04,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:04,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:04,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:04,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:04,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:04,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:04,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:04,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:04,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740648610] [2024-11-12 07:51:04,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740648610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:04,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:04,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:51:04,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23151718] [2024-11-12 07:51:04,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:04,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:51:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:04,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:51:04,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:51:04,969 INFO L87 Difference]: Start difference. First operand 126 states and 183 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:05,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:05,689 INFO L93 Difference]: Finished difference Result 298 states and 432 transitions. [2024-11-12 07:51:05,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:51:05,690 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2024-11-12 07:51:05,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:05,691 INFO L225 Difference]: With dead ends: 298 [2024-11-12 07:51:05,692 INFO L226 Difference]: Without dead ends: 175 [2024-11-12 07:51:05,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:51:05,694 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 343 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:05,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 483 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:51:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-12 07:51:05,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2024-11-12 07:51:05,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 121 states have (on average 1.43801652892562) internal successors, (174), 121 states have internal predecessors, (174), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:51:05,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 192 transitions. [2024-11-12 07:51:05,707 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 192 transitions. Word has length 98 [2024-11-12 07:51:05,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:05,708 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 192 transitions. [2024-11-12 07:51:05,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 192 transitions. [2024-11-12 07:51:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 07:51:05,709 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:05,710 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:05,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:51:05,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:05,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:05,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1403936981, now seen corresponding path program 1 times [2024-11-12 07:51:05,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:05,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675493124] [2024-11-12 07:51:05,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:05,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:06,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:06,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:06,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:06,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:06,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:06,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:06,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:06,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:06,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 07:51:06,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:06,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675493124] [2024-11-12 07:51:06,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675493124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:51:06,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318041818] [2024-11-12 07:51:06,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:06,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:51:06,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:51:06,512 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:51:06,516 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:51:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:06,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-12 07:51:06,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:51:06,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-12 07:51:06,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-12 07:51:07,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2024-11-12 07:51:07,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2024-11-12 07:51:07,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2024-11-12 07:51:07,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2024-11-12 07:51:07,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:51:07,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 38 [2024-11-12 07:51:08,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:51:08,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 17 [2024-11-12 07:51:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-12 07:51:08,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:51:08,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318041818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:51:08,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:51:08,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-11-12 07:51:08,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407017373] [2024-11-12 07:51:08,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:51:08,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 07:51:08,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:08,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 07:51:08,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-12 07:51:08,164 INFO L87 Difference]: Start difference. First operand 132 states and 192 transitions. Second operand has 18 states, 16 states have (on average 5.8125) internal successors, (93), 18 states have internal predecessors, (93), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-12 07:51:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:08,983 INFO L93 Difference]: Finished difference Result 406 states and 584 transitions. [2024-11-12 07:51:08,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 07:51:08,984 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.8125) internal successors, (93), 18 states have internal predecessors, (93), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 98 [2024-11-12 07:51:08,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:08,985 INFO L225 Difference]: With dead ends: 406 [2024-11-12 07:51:08,985 INFO L226 Difference]: Without dead ends: 277 [2024-11-12 07:51:08,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=997, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 07:51:08,986 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 196 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:08,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 951 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:51:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-12 07:51:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 181. [2024-11-12 07:51:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 158 states have (on average 1.3924050632911393) internal successors, (220), 158 states have internal predecessors, (220), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:51:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 256 transitions. [2024-11-12 07:51:08,999 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 256 transitions. Word has length 98 [2024-11-12 07:51:08,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:09,000 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 256 transitions. [2024-11-12 07:51:09,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.8125) internal successors, (93), 18 states have internal predecessors, (93), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-12 07:51:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2024-11-12 07:51:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 07:51:09,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:09,001 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:09,016 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:51:09,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:51:09,202 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:09,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:09,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1504826921, now seen corresponding path program 1 times [2024-11-12 07:51:09,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:09,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155418991] [2024-11-12 07:51:09,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:09,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:10,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:10,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:10,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:10,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:10,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:10,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:10,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:10,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:10,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:10,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:10,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155418991] [2024-11-12 07:51:10,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155418991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:10,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:10,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:51:10,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874182482] [2024-11-12 07:51:10,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:10,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:51:10,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:10,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:51:10,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:51:10,992 INFO L87 Difference]: Start difference. First operand 181 states and 256 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:11,905 INFO L93 Difference]: Finished difference Result 479 states and 687 transitions. [2024-11-12 07:51:11,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:51:11,905 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2024-11-12 07:51:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:11,907 INFO L225 Difference]: With dead ends: 479 [2024-11-12 07:51:11,907 INFO L226 Difference]: Without dead ends: 350 [2024-11-12 07:51:11,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:51:11,908 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 256 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:11,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 682 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:51:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-12 07:51:11,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 304. [2024-11-12 07:51:11,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 271 states have (on average 1.4095940959409594) internal successors, (382), 271 states have internal predecessors, (382), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:51:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 436 transitions. [2024-11-12 07:51:11,937 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 436 transitions. Word has length 98 [2024-11-12 07:51:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:11,938 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 436 transitions. [2024-11-12 07:51:11,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 436 transitions. [2024-11-12 07:51:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:51:11,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:11,939 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:11,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:51:11,939 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:11,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash 181503640, now seen corresponding path program 1 times [2024-11-12 07:51:11,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:11,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158219964] [2024-11-12 07:51:11,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,200 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:12,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:12,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158219964] [2024-11-12 07:51:12,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158219964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:12,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:12,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:51:12,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611066160] [2024-11-12 07:51:12,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:12,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:51:12,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:12,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:51:12,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:51:12,203 INFO L87 Difference]: Start difference. First operand 304 states and 436 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:12,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:12,509 INFO L93 Difference]: Finished difference Result 660 states and 950 transitions. [2024-11-12 07:51:12,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:51:12,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2024-11-12 07:51:12,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:12,511 INFO L225 Difference]: With dead ends: 660 [2024-11-12 07:51:12,511 INFO L226 Difference]: Without dead ends: 408 [2024-11-12 07:51:12,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:51:12,513 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 218 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:12,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 546 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:51:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-12 07:51:12,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 328. [2024-11-12 07:51:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 295 states have (on average 1.4101694915254237) internal successors, (416), 295 states have internal predecessors, (416), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:51:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 470 transitions. [2024-11-12 07:51:12,537 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 470 transitions. Word has length 99 [2024-11-12 07:51:12,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:12,537 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 470 transitions. [2024-11-12 07:51:12,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 470 transitions. [2024-11-12 07:51:12,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:51:12,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:12,539 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:12,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 07:51:12,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:12,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:12,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1392968729, now seen corresponding path program 1 times [2024-11-12 07:51:12,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:12,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762608643] [2024-11-12 07:51:12,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:12,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:12,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:12,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762608643] [2024-11-12 07:51:12,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762608643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:12,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:12,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:51:12,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130879952] [2024-11-12 07:51:12,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:12,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:51:12,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:12,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:51:12,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:51:12,754 INFO L87 Difference]: Start difference. First operand 328 states and 470 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:12,977 INFO L93 Difference]: Finished difference Result 687 states and 986 transitions. [2024-11-12 07:51:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:51:12,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-12 07:51:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:12,979 INFO L225 Difference]: With dead ends: 687 [2024-11-12 07:51:12,979 INFO L226 Difference]: Without dead ends: 411 [2024-11-12 07:51:12,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:51:12,980 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 267 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:12,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 562 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:51:12,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-12 07:51:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 328. [2024-11-12 07:51:13,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 295 states have (on average 1.3966101694915254) internal successors, (412), 295 states have internal predecessors, (412), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:51:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 466 transitions. [2024-11-12 07:51:13,006 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 466 transitions. Word has length 99 [2024-11-12 07:51:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:13,006 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 466 transitions. [2024-11-12 07:51:13,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 466 transitions. [2024-11-12 07:51:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 07:51:13,008 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:13,008 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:13,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:51:13,008 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:13,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:13,009 INFO L85 PathProgramCache]: Analyzing trace with hash -814969296, now seen corresponding path program 1 times [2024-11-12 07:51:13,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:13,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635055070] [2024-11-12 07:51:13,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:13,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:13,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:13,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:13,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:13,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:13,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:13,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:13,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:13,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:13,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:13,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:13,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635055070] [2024-11-12 07:51:13,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635055070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:13,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:13,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:51:13,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089324860] [2024-11-12 07:51:13,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:13,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:51:13,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:13,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:51:13,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:51:13,088 INFO L87 Difference]: Start difference. First operand 328 states and 466 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:13,111 INFO L93 Difference]: Finished difference Result 475 states and 682 transitions. [2024-11-12 07:51:13,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:51:13,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-12 07:51:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:13,114 INFO L225 Difference]: With dead ends: 475 [2024-11-12 07:51:13,114 INFO L226 Difference]: Without dead ends: 334 [2024-11-12 07:51:13,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:51:13,115 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:13,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:51:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-12 07:51:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2024-11-12 07:51:13,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 301 states have (on average 1.388704318936877) internal successors, (418), 301 states have internal predecessors, (418), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:51:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 472 transitions. [2024-11-12 07:51:13,136 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 472 transitions. Word has length 100 [2024-11-12 07:51:13,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:13,137 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 472 transitions. [2024-11-12 07:51:13,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 472 transitions. [2024-11-12 07:51:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 07:51:13,138 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:13,138 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:13,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 07:51:13,138 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:13,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:13,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1261794002, now seen corresponding path program 1 times [2024-11-12 07:51:13,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:13,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920137243] [2024-11-12 07:51:13,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:13,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:14,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:14,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920137243] [2024-11-12 07:51:14,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920137243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:14,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:14,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:51:14,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897160812] [2024-11-12 07:51:14,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:14,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:51:14,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:14,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:51:14,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:51:14,147 INFO L87 Difference]: Start difference. First operand 334 states and 472 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:14,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:14,510 INFO L93 Difference]: Finished difference Result 716 states and 1019 transitions. [2024-11-12 07:51:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:51:14,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2024-11-12 07:51:14,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:14,513 INFO L225 Difference]: With dead ends: 716 [2024-11-12 07:51:14,513 INFO L226 Difference]: Without dead ends: 434 [2024-11-12 07:51:14,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:51:14,514 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 403 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:14,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 452 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:51:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-12 07:51:14,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 398. [2024-11-12 07:51:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 365 states have (on average 1.3945205479452054) internal successors, (509), 365 states have internal predecessors, (509), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:51:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 563 transitions. [2024-11-12 07:51:14,545 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 563 transitions. Word has length 100 [2024-11-12 07:51:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:14,546 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 563 transitions. [2024-11-12 07:51:14,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 563 transitions. [2024-11-12 07:51:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 07:51:14,546 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:14,547 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:14,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 07:51:14,547 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:14,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:14,547 INFO L85 PathProgramCache]: Analyzing trace with hash 250676752, now seen corresponding path program 1 times [2024-11-12 07:51:14,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:14,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157711907] [2024-11-12 07:51:14,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:14,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:14,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:14,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157711907] [2024-11-12 07:51:14,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157711907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:14,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:14,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:51:14,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473495446] [2024-11-12 07:51:14,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:14,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:51:14,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:14,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:51:14,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:51:14,656 INFO L87 Difference]: Start difference. First operand 398 states and 563 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:14,698 INFO L93 Difference]: Finished difference Result 749 states and 1066 transitions. [2024-11-12 07:51:14,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:51:14,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-12 07:51:14,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:14,699 INFO L225 Difference]: With dead ends: 749 [2024-11-12 07:51:14,700 INFO L226 Difference]: Without dead ends: 403 [2024-11-12 07:51:14,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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:51:14,700 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:14,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:51:14,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-12 07:51:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2024-11-12 07:51:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 370 states have (on average 1.3891891891891892) internal successors, (514), 370 states have internal predecessors, (514), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:51:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 568 transitions. [2024-11-12 07:51:14,724 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 568 transitions. Word has length 100 [2024-11-12 07:51:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:14,724 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 568 transitions. [2024-11-12 07:51:14,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 568 transitions. [2024-11-12 07:51:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 07:51:14,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:14,725 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:14,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 07:51:14,726 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:14,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:14,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1461008104, now seen corresponding path program 1 times [2024-11-12 07:51:14,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:14,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589778608] [2024-11-12 07:51:14,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:14,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:15,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:15,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:15,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:15,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:15,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:15,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:15,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:15,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:15,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:15,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:15,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589778608] [2024-11-12 07:51:15,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589778608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:15,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:15,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:51:15,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030294292] [2024-11-12 07:51:15,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:15,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:51:15,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:15,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:51:15,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:51:15,167 INFO L87 Difference]: Start difference. First operand 403 states and 568 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:15,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:15,635 INFO L93 Difference]: Finished difference Result 850 states and 1198 transitions. [2024-11-12 07:51:15,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:51:15,636 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2024-11-12 07:51:15,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:15,638 INFO L225 Difference]: With dead ends: 850 [2024-11-12 07:51:15,639 INFO L226 Difference]: Without dead ends: 499 [2024-11-12 07:51:15,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:51:15,640 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 217 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:15,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 812 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:51:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-12 07:51:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 403. [2024-11-12 07:51:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 370 states have (on average 1.3891891891891892) internal successors, (514), 370 states have internal predecessors, (514), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:51:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 568 transitions. [2024-11-12 07:51:15,665 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 568 transitions. Word has length 100 [2024-11-12 07:51:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:15,665 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 568 transitions. [2024-11-12 07:51:15,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:15,665 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 568 transitions. [2024-11-12 07:51:15,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 07:51:15,666 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:15,666 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:15,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 07:51:15,667 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:15,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:15,667 INFO L85 PathProgramCache]: Analyzing trace with hash -315157932, now seen corresponding path program 1 times [2024-11-12 07:51:15,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:15,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795333135] [2024-11-12 07:51:15,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:15,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:16,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:16,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:16,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:16,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:16,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:16,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:16,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:16,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:16,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:16,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:16,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795333135] [2024-11-12 07:51:16,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795333135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:16,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:16,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 07:51:16,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179055888] [2024-11-12 07:51:16,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:16,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 07:51:16,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:16,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 07:51:16,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:51:16,121 INFO L87 Difference]: Start difference. First operand 403 states and 568 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:16,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:16,936 INFO L93 Difference]: Finished difference Result 1237 states and 1750 transitions. [2024-11-12 07:51:16,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 07:51:16,937 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-12 07:51:16,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:16,940 INFO L225 Difference]: With dead ends: 1237 [2024-11-12 07:51:16,940 INFO L226 Difference]: Without dead ends: 886 [2024-11-12 07:51:16,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2024-11-12 07:51:16,941 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 524 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:16,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1144 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:51:16,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-12 07:51:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 494. [2024-11-12 07:51:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 461 states have (on average 1.420824295010846) internal successors, (655), 461 states have internal predecessors, (655), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:51:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 709 transitions. [2024-11-12 07:51:16,966 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 709 transitions. Word has length 100 [2024-11-12 07:51:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:16,966 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 709 transitions. [2024-11-12 07:51:16,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 709 transitions. [2024-11-12 07:51:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 07:51:16,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:16,967 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:16,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 07:51:16,967 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:16,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:16,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1245183907, now seen corresponding path program 1 times [2024-11-12 07:51:16,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:16,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957240711] [2024-11-12 07:51:16,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:16,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,134 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:17,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:17,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957240711] [2024-11-12 07:51:17,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957240711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:17,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:17,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:51:17,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651688005] [2024-11-12 07:51:17,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:17,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:51:17,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:17,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:51:17,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:51:17,136 INFO L87 Difference]: Start difference. First operand 494 states and 709 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:17,437 INFO L93 Difference]: Finished difference Result 1013 states and 1449 transitions. [2024-11-12 07:51:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:51:17,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2024-11-12 07:51:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:17,439 INFO L225 Difference]: With dead ends: 1013 [2024-11-12 07:51:17,439 INFO L226 Difference]: Without dead ends: 571 [2024-11-12 07:51:17,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:51:17,440 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 273 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:17,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 457 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:51:17,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-11-12 07:51:17,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 485. [2024-11-12 07:51:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 452 states have (on average 1.4092920353982301) internal successors, (637), 452 states have internal predecessors, (637), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:51:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 691 transitions. [2024-11-12 07:51:17,467 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 691 transitions. Word has length 101 [2024-11-12 07:51:17,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:17,467 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 691 transitions. [2024-11-12 07:51:17,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 691 transitions. [2024-11-12 07:51:17,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 07:51:17,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:17,468 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:17,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 07:51:17,468 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:17,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:17,469 INFO L85 PathProgramCache]: Analyzing trace with hash -46889335, now seen corresponding path program 1 times [2024-11-12 07:51:17,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:17,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341504988] [2024-11-12 07:51:17,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:17,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:17,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:17,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341504988] [2024-11-12 07:51:17,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341504988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:17,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:17,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 07:51:17,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568060192] [2024-11-12 07:51:17,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:17,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 07:51:17,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:17,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 07:51:17,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:51:17,963 INFO L87 Difference]: Start difference. First operand 485 states and 691 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:18,937 INFO L93 Difference]: Finished difference Result 1344 states and 1887 transitions. [2024-11-12 07:51:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 07:51:18,937 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2024-11-12 07:51:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:18,940 INFO L225 Difference]: With dead ends: 1344 [2024-11-12 07:51:18,940 INFO L226 Difference]: Without dead ends: 911 [2024-11-12 07:51:18,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2024-11-12 07:51:18,941 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 448 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:18,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1485 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:51:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2024-11-12 07:51:18,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 515. [2024-11-12 07:51:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 482 states have (on average 1.4211618257261411) internal successors, (685), 482 states have internal predecessors, (685), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:51:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 739 transitions. [2024-11-12 07:51:18,979 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 739 transitions. Word has length 101 [2024-11-12 07:51:18,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:18,981 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 739 transitions. [2024-11-12 07:51:18,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 739 transitions. [2024-11-12 07:51:18,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 07:51:18,983 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:18,983 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:18,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 07:51:18,984 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:18,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:18,984 INFO L85 PathProgramCache]: Analyzing trace with hash 865211316, now seen corresponding path program 1 times [2024-11-12 07:51:18,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:18,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97700813] [2024-11-12 07:51:18,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:18,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:19,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:19,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:19,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:19,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:19,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:19,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:19,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:19,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:19,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:19,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:19,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97700813] [2024-11-12 07:51:19,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97700813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:19,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:19,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-12 07:51:19,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167346799] [2024-11-12 07:51:19,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:19,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 07:51:19,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:19,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 07:51:19,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:51:19,621 INFO L87 Difference]: Start difference. First operand 515 states and 739 transitions. Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:20,731 INFO L93 Difference]: Finished difference Result 1504 states and 2111 transitions. [2024-11-12 07:51:20,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 07:51:20,731 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 101 [2024-11-12 07:51:20,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:20,736 INFO L225 Difference]: With dead ends: 1504 [2024-11-12 07:51:20,736 INFO L226 Difference]: Without dead ends: 1041 [2024-11-12 07:51:20,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2024-11-12 07:51:20,737 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 594 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:20,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1246 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:51:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2024-11-12 07:51:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 515. [2024-11-12 07:51:20,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 482 states have (on average 1.4211618257261411) internal successors, (685), 482 states have internal predecessors, (685), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:51:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 739 transitions. [2024-11-12 07:51:20,763 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 739 transitions. Word has length 101 [2024-11-12 07:51:20,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:20,764 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 739 transitions. [2024-11-12 07:51:20,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 739 transitions. [2024-11-12 07:51:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 07:51:20,765 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:20,765 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:20,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 07:51:20,765 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:20,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash -690899567, now seen corresponding path program 1 times [2024-11-12 07:51:20,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:20,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141326606] [2024-11-12 07:51:20,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:20,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:20,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:20,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:20,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:20,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:20,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:20,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:20,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:20,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:20,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:20,881 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:20,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:20,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141326606] [2024-11-12 07:51:20,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141326606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:20,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:20,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:51:20,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841984678] [2024-11-12 07:51:20,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:20,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:51:20,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:20,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:51:20,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:51:20,884 INFO L87 Difference]: Start difference. First operand 515 states and 739 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:21,073 INFO L93 Difference]: Finished difference Result 1100 states and 1560 transitions. [2024-11-12 07:51:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:51:21,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 102 [2024-11-12 07:51:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:21,075 INFO L225 Difference]: With dead ends: 1100 [2024-11-12 07:51:21,075 INFO L226 Difference]: Without dead ends: 607 [2024-11-12 07:51:21,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:51:21,077 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 56 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:21,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 601 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:51:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-12 07:51:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 509. [2024-11-12 07:51:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 476 states have (on average 1.4054621848739495) internal successors, (669), 476 states have internal predecessors, (669), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:51:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 723 transitions. [2024-11-12 07:51:21,100 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 723 transitions. Word has length 102 [2024-11-12 07:51:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:21,100 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 723 transitions. [2024-11-12 07:51:21,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 723 transitions. [2024-11-12 07:51:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 07:51:21,101 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:21,101 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:21,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 07:51:21,102 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:21,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:21,102 INFO L85 PathProgramCache]: Analyzing trace with hash 313555319, now seen corresponding path program 1 times [2024-11-12 07:51:21,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:21,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272628208] [2024-11-12 07:51:21,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:21,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:21,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:21,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:21,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:21,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:21,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:21,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:21,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:21,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272628208] [2024-11-12 07:51:21,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272628208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:21,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:21,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 07:51:21,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030077465] [2024-11-12 07:51:21,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:21,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 07:51:21,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:21,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 07:51:21,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:51:21,501 INFO L87 Difference]: Start difference. First operand 509 states and 723 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:22,326 INFO L93 Difference]: Finished difference Result 1190 states and 1690 transitions. [2024-11-12 07:51:22,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 07:51:22,326 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 102 [2024-11-12 07:51:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:22,329 INFO L225 Difference]: With dead ends: 1190 [2024-11-12 07:51:22,329 INFO L226 Difference]: Without dead ends: 733 [2024-11-12 07:51:22,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:51:22,330 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 338 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:22,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1091 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:51:22,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-12 07:51:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 539. [2024-11-12 07:51:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 506 states have (on average 1.4051383399209487) internal successors, (711), 506 states have internal predecessors, (711), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:51:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 765 transitions. [2024-11-12 07:51:22,352 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 765 transitions. Word has length 102 [2024-11-12 07:51:22,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:22,353 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 765 transitions. [2024-11-12 07:51:22,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 765 transitions. [2024-11-12 07:51:22,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 07:51:22,354 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:22,354 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:22,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 07:51:22,354 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:22,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:22,355 INFO L85 PathProgramCache]: Analyzing trace with hash 694783071, now seen corresponding path program 1 times [2024-11-12 07:51:22,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:22,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324938947] [2024-11-12 07:51:22,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:22,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:22,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:22,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:22,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:22,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:22,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:22,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:22,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:22,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:22,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:22,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:22,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324938947] [2024-11-12 07:51:22,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324938947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:22,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:22,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:51:22,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152574568] [2024-11-12 07:51:22,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:22,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:51:22,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:22,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:51:22,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:51:22,532 INFO L87 Difference]: Start difference. First operand 539 states and 765 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:22,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:22,817 INFO L93 Difference]: Finished difference Result 946 states and 1338 transitions. [2024-11-12 07:51:22,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:51:22,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 102 [2024-11-12 07:51:22,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:22,820 INFO L225 Difference]: With dead ends: 946 [2024-11-12 07:51:22,820 INFO L226 Difference]: Without dead ends: 651 [2024-11-12 07:51:22,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:51:22,821 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 290 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:22,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 537 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:51:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-12 07:51:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 539. [2024-11-12 07:51:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 506 states have (on average 1.4031620553359683) internal successors, (710), 506 states have internal predecessors, (710), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:51:22,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 764 transitions. [2024-11-12 07:51:22,846 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 764 transitions. Word has length 102 [2024-11-12 07:51:22,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:22,847 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 764 transitions. [2024-11-12 07:51:22,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:22,847 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 764 transitions. [2024-11-12 07:51:22,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 07:51:22,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:22,848 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:22,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 07:51:22,848 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:22,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash 533212757, now seen corresponding path program 1 times [2024-11-12 07:51:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:22,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100463144] [2024-11-12 07:51:22,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:22,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:23,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:23,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:23,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:23,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:23,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:23,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:23,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:23,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:23,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100463144] [2024-11-12 07:51:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100463144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:23,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:23,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:51:23,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315499965] [2024-11-12 07:51:23,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:23,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:51:23,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:23,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:51:23,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:51:23,831 INFO L87 Difference]: Start difference. First operand 539 states and 764 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-12 07:51:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:24,399 INFO L93 Difference]: Finished difference Result 1210 states and 1712 transitions. [2024-11-12 07:51:24,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:51:24,400 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 102 [2024-11-12 07:51:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:24,402 INFO L225 Difference]: With dead ends: 1210 [2024-11-12 07:51:24,402 INFO L226 Difference]: Without dead ends: 717 [2024-11-12 07:51:24,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:51:24,404 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 403 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:24,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 917 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:51:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-11-12 07:51:24,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 582. [2024-11-12 07:51:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 549 states have (on average 1.4007285974499089) internal successors, (769), 549 states have internal predecessors, (769), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:51:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 823 transitions. [2024-11-12 07:51:24,429 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 823 transitions. Word has length 102 [2024-11-12 07:51:24,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:24,430 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 823 transitions. [2024-11-12 07:51:24,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-12 07:51:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 823 transitions. [2024-11-12 07:51:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 07:51:24,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:24,431 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:24,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 07:51:24,431 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:24,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:24,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1371131698, now seen corresponding path program 1 times [2024-11-12 07:51:24,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:24,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900522841] [2024-11-12 07:51:24,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:24,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:24,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:24,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:24,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:24,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:24,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:24,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:24,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:24,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:24,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:24,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:24,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900522841] [2024-11-12 07:51:24,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900522841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:24,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:24,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:51:24,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900602618] [2024-11-12 07:51:24,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:24,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:51:24,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:24,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:51:24,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:51:24,811 INFO L87 Difference]: Start difference. First operand 582 states and 823 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:25,505 INFO L93 Difference]: Finished difference Result 962 states and 1368 transitions. [2024-11-12 07:51:25,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 07:51:25,506 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 103 [2024-11-12 07:51:25,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:25,508 INFO L225 Difference]: With dead ends: 962 [2024-11-12 07:51:25,508 INFO L226 Difference]: Without dead ends: 667 [2024-11-12 07:51:25,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:51:25,509 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 262 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:25,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 861 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:51:25,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-11-12 07:51:25,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 608. [2024-11-12 07:51:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 575 states have (on average 1.4173913043478261) internal successors, (815), 575 states have internal predecessors, (815), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:51:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 869 transitions. [2024-11-12 07:51:25,532 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 869 transitions. Word has length 103 [2024-11-12 07:51:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:25,532 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 869 transitions. [2024-11-12 07:51:25,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:25,533 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 869 transitions. [2024-11-12 07:51:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 07:51:25,533 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:25,533 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:25,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 07:51:25,534 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:25,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:25,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1643971920, now seen corresponding path program 1 times [2024-11-12 07:51:25,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:25,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000297683] [2024-11-12 07:51:25,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:25,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:26,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:26,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:26,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:26,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:26,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:26,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:26,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:26,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:26,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:26,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:26,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000297683] [2024-11-12 07:51:26,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000297683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:26,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:26,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:51:26,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063129048] [2024-11-12 07:51:26,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:26,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:51:26,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:26,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:51:26,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:51:26,690 INFO L87 Difference]: Start difference. First operand 608 states and 869 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:26,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:26,915 INFO L93 Difference]: Finished difference Result 1324 states and 1906 transitions. [2024-11-12 07:51:26,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:51:26,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 103 [2024-11-12 07:51:26,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:26,918 INFO L225 Difference]: With dead ends: 1324 [2024-11-12 07:51:26,918 INFO L226 Difference]: Without dead ends: 814 [2024-11-12 07:51:26,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:51:26,919 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 311 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:26,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 530 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:51:26,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2024-11-12 07:51:26,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 702. [2024-11-12 07:51:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 659 states have (on average 1.393019726858877) internal successors, (918), 659 states have internal predecessors, (918), 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:51:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 990 transitions. [2024-11-12 07:51:26,949 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 990 transitions. Word has length 103 [2024-11-12 07:51:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:26,949 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 990 transitions. [2024-11-12 07:51:26,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 990 transitions. [2024-11-12 07:51:26,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 07:51:26,950 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:26,950 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:26,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 07:51:26,950 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:26,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:26,951 INFO L85 PathProgramCache]: Analyzing trace with hash 773557388, now seen corresponding path program 1 times [2024-11-12 07:51:26,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:26,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424548423] [2024-11-12 07:51:26,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:26,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:27,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:27,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:27,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:27,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:27,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:27,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:27,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:27,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:27,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:27,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:27,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424548423] [2024-11-12 07:51:27,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424548423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:27,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:27,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 07:51:27,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942820290] [2024-11-12 07:51:27,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:27,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 07:51:27,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:27,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 07:51:27,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:51:27,405 INFO L87 Difference]: Start difference. First operand 702 states and 990 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:28,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:28,399 INFO L93 Difference]: Finished difference Result 1727 states and 2418 transitions. [2024-11-12 07:51:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 07:51:28,399 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 103 [2024-11-12 07:51:28,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:28,402 INFO L225 Difference]: With dead ends: 1727 [2024-11-12 07:51:28,402 INFO L226 Difference]: Without dead ends: 1100 [2024-11-12 07:51:28,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2024-11-12 07:51:28,404 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 428 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:28,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1493 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:51:28,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2024-11-12 07:51:28,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 721. [2024-11-12 07:51:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 678 states have (on average 1.3952802359882006) internal successors, (946), 678 states have internal predecessors, (946), 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:51:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1018 transitions. [2024-11-12 07:51:28,471 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1018 transitions. Word has length 103 [2024-11-12 07:51:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:28,472 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1018 transitions. [2024-11-12 07:51:28,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1018 transitions. [2024-11-12 07:51:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-12 07:51:28,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:28,473 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:28,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 07:51:28,473 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:28,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:28,473 INFO L85 PathProgramCache]: Analyzing trace with hash 374293398, now seen corresponding path program 1 times [2024-11-12 07:51:28,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:28,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471045996] [2024-11-12 07:51:28,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:28,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:28,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:28,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:28,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:28,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:28,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:28,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:28,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:28,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:28,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:28,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:28,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471045996] [2024-11-12 07:51:28,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471045996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:28,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:28,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:51:28,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663477937] [2024-11-12 07:51:28,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:28,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:51:28,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:28,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:51:28,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:51:28,649 INFO L87 Difference]: Start difference. First operand 721 states and 1018 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:28,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:28,723 INFO L93 Difference]: Finished difference Result 1371 states and 1943 transitions. [2024-11-12 07:51:28,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:51:28,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2024-11-12 07:51:28,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:28,726 INFO L225 Difference]: With dead ends: 1371 [2024-11-12 07:51:28,729 INFO L226 Difference]: Without dead ends: 730 [2024-11-12 07:51:28,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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:51:28,730 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:28,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:51:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-11-12 07:51:28,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2024-11-12 07:51:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 687 states have (on average 1.3901018922852983) internal successors, (955), 687 states have internal predecessors, (955), 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:51:28,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1027 transitions. [2024-11-12 07:51:28,791 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1027 transitions. Word has length 104 [2024-11-12 07:51:28,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:28,791 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1027 transitions. [2024-11-12 07:51:28,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:28,791 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1027 transitions. [2024-11-12 07:51:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-12 07:51:28,792 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:28,792 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:28,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 07:51:28,792 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:28,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:28,796 INFO L85 PathProgramCache]: Analyzing trace with hash -731481094, now seen corresponding path program 1 times [2024-11-12 07:51:28,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:28,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238966339] [2024-11-12 07:51:28,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:28,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:29,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:29,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:29,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:29,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:29,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:29,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:29,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:29,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:29,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:29,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:29,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238966339] [2024-11-12 07:51:29,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238966339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:29,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:29,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:51:29,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514629611] [2024-11-12 07:51:29,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:29,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:51:29,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:29,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:51:29,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:51:29,667 INFO L87 Difference]: Start difference. First operand 730 states and 1027 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:29,892 INFO L93 Difference]: Finished difference Result 1381 states and 1950 transitions. [2024-11-12 07:51:29,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:51:29,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 104 [2024-11-12 07:51:29,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:29,895 INFO L225 Difference]: With dead ends: 1381 [2024-11-12 07:51:29,895 INFO L226 Difference]: Without dead ends: 725 [2024-11-12 07:51:29,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:51:29,897 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 69 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:29,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 420 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:51:29,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-12 07:51:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2024-11-12 07:51:29,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 682 states have (on average 1.3900293255131966) internal successors, (948), 682 states have internal predecessors, (948), 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:51:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1020 transitions. [2024-11-12 07:51:29,940 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1020 transitions. Word has length 104 [2024-11-12 07:51:29,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:29,940 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1020 transitions. [2024-11-12 07:51:29,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1020 transitions. [2024-11-12 07:51:29,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-12 07:51:29,941 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:29,942 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:29,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 07:51:29,942 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:29,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:29,942 INFO L85 PathProgramCache]: Analyzing trace with hash -867628502, now seen corresponding path program 1 times [2024-11-12 07:51:29,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:29,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20127689] [2024-11-12 07:51:29,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:29,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:30,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:30,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:30,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:30,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:30,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:30,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:30,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:30,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:30,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:30,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:30,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20127689] [2024-11-12 07:51:30,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20127689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:30,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:30,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 07:51:30,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110457963] [2024-11-12 07:51:30,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:30,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 07:51:30,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:30,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 07:51:30,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:51:30,472 INFO L87 Difference]: Start difference. First operand 725 states and 1020 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:31,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:31,269 INFO L93 Difference]: Finished difference Result 1653 states and 2307 transitions. [2024-11-12 07:51:31,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 07:51:31,269 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2024-11-12 07:51:31,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:31,272 INFO L225 Difference]: With dead ends: 1653 [2024-11-12 07:51:31,272 INFO L226 Difference]: Without dead ends: 1003 [2024-11-12 07:51:31,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-12 07:51:31,273 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 282 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:31,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 1433 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:51:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2024-11-12 07:51:31,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 752. [2024-11-12 07:51:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 709 states have (on average 1.3892806770098731) internal successors, (985), 709 states have internal predecessors, (985), 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:51:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1057 transitions. [2024-11-12 07:51:31,305 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1057 transitions. Word has length 104 [2024-11-12 07:51:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:31,306 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 1057 transitions. [2024-11-12 07:51:31,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1057 transitions. [2024-11-12 07:51:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-12 07:51:31,306 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:31,307 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:31,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-12 07:51:31,307 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:31,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:31,307 INFO L85 PathProgramCache]: Analyzing trace with hash -710127411, now seen corresponding path program 1 times [2024-11-12 07:51:31,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:31,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362494863] [2024-11-12 07:51:31,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:31,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:32,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:32,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:32,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:32,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:32,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:32,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:32,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:32,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:32,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:32,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:32,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362494863] [2024-11-12 07:51:32,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362494863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:32,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:32,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 07:51:32,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078006620] [2024-11-12 07:51:32,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:32,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 07:51:32,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:32,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 07:51:32,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:51:32,426 INFO L87 Difference]: Start difference. First operand 752 states and 1057 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:33,220 INFO L93 Difference]: Finished difference Result 1504 states and 2111 transitions. [2024-11-12 07:51:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 07:51:33,220 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 104 [2024-11-12 07:51:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:33,223 INFO L225 Difference]: With dead ends: 1504 [2024-11-12 07:51:33,223 INFO L226 Difference]: Without dead ends: 836 [2024-11-12 07:51:33,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2024-11-12 07:51:33,224 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 186 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:33,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1116 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:51:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2024-11-12 07:51:33,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 750. [2024-11-12 07:51:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 707 states have (on average 1.388967468175389) internal successors, (982), 707 states have internal predecessors, (982), 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:51:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1054 transitions. [2024-11-12 07:51:33,256 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1054 transitions. Word has length 104 [2024-11-12 07:51:33,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:33,256 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1054 transitions. [2024-11-12 07:51:33,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1054 transitions. [2024-11-12 07:51:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 07:51:33,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:33,257 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:33,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-12 07:51:33,258 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:33,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash 810231134, now seen corresponding path program 1 times [2024-11-12 07:51:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:33,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653692790] [2024-11-12 07:51:33,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:33,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:33,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:33,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:33,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:33,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:33,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:33,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:33,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:33,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:33,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:33,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:33,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653692790] [2024-11-12 07:51:33,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653692790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:33,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:33,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:51:33,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804289447] [2024-11-12 07:51:33,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:33,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:51:33,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:33,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:51:33,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:51:33,632 INFO L87 Difference]: Start difference. First operand 750 states and 1054 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:34,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:34,335 INFO L93 Difference]: Finished difference Result 1672 states and 2322 transitions. [2024-11-12 07:51:34,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 07:51:34,336 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2024-11-12 07:51:34,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:34,339 INFO L225 Difference]: With dead ends: 1672 [2024-11-12 07:51:34,339 INFO L226 Difference]: Without dead ends: 1000 [2024-11-12 07:51:34,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2024-11-12 07:51:34,341 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 268 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:34,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1245 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:51:34,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2024-11-12 07:51:34,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 807. [2024-11-12 07:51:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 764 states have (on average 1.37565445026178) internal successors, (1051), 764 states have internal predecessors, (1051), 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:51:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1123 transitions. [2024-11-12 07:51:34,379 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1123 transitions. Word has length 105 [2024-11-12 07:51:34,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:34,380 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1123 transitions. [2024-11-12 07:51:34,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1123 transitions. [2024-11-12 07:51:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 07:51:34,381 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:34,381 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:34,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-12 07:51:34,382 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:34,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:34,382 INFO L85 PathProgramCache]: Analyzing trace with hash 518930393, now seen corresponding path program 1 times [2024-11-12 07:51:34,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:34,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996321617] [2024-11-12 07:51:34,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:34,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:34,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:34,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:34,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:34,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:34,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:34,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:34,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:34,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:34,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:34,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:34,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996321617] [2024-11-12 07:51:34,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996321617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:34,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:34,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:51:34,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437659800] [2024-11-12 07:51:34,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:34,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:51:34,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:34,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:51:34,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:51:34,951 INFO L87 Difference]: Start difference. First operand 807 states and 1123 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:35,805 INFO L93 Difference]: Finished difference Result 1907 states and 2647 transitions. [2024-11-12 07:51:35,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 07:51:35,809 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2024-11-12 07:51:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:35,817 INFO L225 Difference]: With dead ends: 1907 [2024-11-12 07:51:35,817 INFO L226 Difference]: Without dead ends: 1187 [2024-11-12 07:51:35,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-11-12 07:51:35,819 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 409 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:35,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1053 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:51:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2024-11-12 07:51:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 858. [2024-11-12 07:51:35,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 815 states have (on average 1.3877300613496932) internal successors, (1131), 815 states have internal predecessors, (1131), 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:51:35,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1203 transitions. [2024-11-12 07:51:35,901 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1203 transitions. Word has length 105 [2024-11-12 07:51:35,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:35,902 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1203 transitions. [2024-11-12 07:51:35,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1203 transitions. [2024-11-12 07:51:35,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 07:51:35,902 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:35,903 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:35,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-12 07:51:35,903 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:35,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:35,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1562954717, now seen corresponding path program 1 times [2024-11-12 07:51:35,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:35,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744503549] [2024-11-12 07:51:35,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:35,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:36,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:36,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:36,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:36,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:36,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:36,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:36,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:36,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:36,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:36,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:36,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744503549] [2024-11-12 07:51:36,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744503549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:36,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:36,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:51:36,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643844176] [2024-11-12 07:51:36,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:36,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:51:36,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:36,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:51:36,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:51:36,384 INFO L87 Difference]: Start difference. First operand 858 states and 1203 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:37,000 INFO L93 Difference]: Finished difference Result 1568 states and 2202 transitions. [2024-11-12 07:51:37,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:51:37,001 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2024-11-12 07:51:37,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:37,005 INFO L225 Difference]: With dead ends: 1568 [2024-11-12 07:51:37,005 INFO L226 Difference]: Without dead ends: 995 [2024-11-12 07:51:37,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:51:37,010 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 172 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:37,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 914 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:51:37,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2024-11-12 07:51:37,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 873. [2024-11-12 07:51:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 830 states have (on average 1.3927710843373493) internal successors, (1156), 830 states have internal predecessors, (1156), 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:51:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1228 transitions. [2024-11-12 07:51:37,094 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1228 transitions. Word has length 105 [2024-11-12 07:51:37,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:37,095 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1228 transitions. [2024-11-12 07:51:37,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:37,095 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1228 transitions. [2024-11-12 07:51:37,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 07:51:37,095 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:37,095 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:37,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-12 07:51:37,096 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:37,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:37,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1452148901, now seen corresponding path program 1 times [2024-11-12 07:51:37,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:37,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30052571] [2024-11-12 07:51:37,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:37,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:38,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:38,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:38,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:38,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:38,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:38,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:38,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:38,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:38,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:38,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:38,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30052571] [2024-11-12 07:51:38,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30052571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:38,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:38,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:51:38,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279016450] [2024-11-12 07:51:38,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:38,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:51:38,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:38,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:51:38,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:51:38,566 INFO L87 Difference]: Start difference. First operand 873 states and 1228 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:39,003 INFO L93 Difference]: Finished difference Result 1470 states and 2079 transitions. [2024-11-12 07:51:39,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:51:39,004 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 105 [2024-11-12 07:51:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:39,006 INFO L225 Difference]: With dead ends: 1470 [2024-11-12 07:51:39,006 INFO L226 Difference]: Without dead ends: 886 [2024-11-12 07:51:39,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:51:39,011 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 220 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:39,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 498 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:51:39,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-12 07:51:39,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 871. [2024-11-12 07:51:39,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 828 states have (on average 1.391304347826087) internal successors, (1152), 828 states have internal predecessors, (1152), 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:51:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1224 transitions. [2024-11-12 07:51:39,082 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1224 transitions. Word has length 105 [2024-11-12 07:51:39,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:39,082 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1224 transitions. [2024-11-12 07:51:39,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:39,083 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1224 transitions. [2024-11-12 07:51:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 07:51:39,084 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:39,085 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:39,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-12 07:51:39,085 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:39,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:39,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2138809462, now seen corresponding path program 1 times [2024-11-12 07:51:39,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:39,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366323655] [2024-11-12 07:51:39,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:39,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:39,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:39,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:39,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:39,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:39,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:39,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:39,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:39,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:39,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:39,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:39,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366323655] [2024-11-12 07:51:39,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366323655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:39,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:39,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 07:51:39,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804437436] [2024-11-12 07:51:39,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:39,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 07:51:39,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:39,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 07:51:39,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:51:39,724 INFO L87 Difference]: Start difference. First operand 871 states and 1224 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:40,743 INFO L93 Difference]: Finished difference Result 1812 states and 2535 transitions. [2024-11-12 07:51:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 07:51:40,743 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 105 [2024-11-12 07:51:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:40,746 INFO L225 Difference]: With dead ends: 1812 [2024-11-12 07:51:40,746 INFO L226 Difference]: Without dead ends: 1031 [2024-11-12 07:51:40,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2024-11-12 07:51:40,747 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 398 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:40,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1395 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:51:40,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2024-11-12 07:51:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 863. [2024-11-12 07:51:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 820 states have (on average 1.3792682926829267) internal successors, (1131), 820 states have internal predecessors, (1131), 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:51:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1203 transitions. [2024-11-12 07:51:40,783 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1203 transitions. Word has length 105 [2024-11-12 07:51:40,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:40,784 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1203 transitions. [2024-11-12 07:51:40,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:40,784 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1203 transitions. [2024-11-12 07:51:40,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-12 07:51:40,785 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:40,785 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:40,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-12 07:51:40,785 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:40,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:40,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1326025307, now seen corresponding path program 1 times [2024-11-12 07:51:40,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:40,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169289320] [2024-11-12 07:51:40,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:40,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:40,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:40,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:40,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:40,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:40,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:40,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:40,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:40,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:40,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169289320] [2024-11-12 07:51:40,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169289320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:40,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:40,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:51:40,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818448196] [2024-11-12 07:51:40,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:40,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:51:40,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:40,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:51:40,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:51:40,848 INFO L87 Difference]: Start difference. First operand 863 states and 1203 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:40,880 INFO L93 Difference]: Finished difference Result 1640 states and 2295 transitions. [2024-11-12 07:51:40,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:51:40,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 106 [2024-11-12 07:51:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:40,883 INFO L225 Difference]: With dead ends: 1640 [2024-11-12 07:51:40,883 INFO L226 Difference]: Without dead ends: 866 [2024-11-12 07:51:40,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:51:40,884 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:40,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:51:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-11-12 07:51:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2024-11-12 07:51:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 823 states have (on average 1.3778857837181044) internal successors, (1134), 823 states have internal predecessors, (1134), 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:51:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1206 transitions. [2024-11-12 07:51:40,918 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1206 transitions. Word has length 106 [2024-11-12 07:51:40,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:40,918 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1206 transitions. [2024-11-12 07:51:40,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1206 transitions. [2024-11-12 07:51:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-12 07:51:40,919 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:40,919 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:40,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-12 07:51:40,919 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:40,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:40,920 INFO L85 PathProgramCache]: Analyzing trace with hash 721618541, now seen corresponding path program 1 times [2024-11-12 07:51:40,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:40,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823616842] [2024-11-12 07:51:40,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:40,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:42,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:51:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:42,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:51:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:42,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:51:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:42,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:51:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:42,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:51:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:42,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:51:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:42,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:51:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:42,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:51:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:42,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:51:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:42,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:51:42,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823616842] [2024-11-12 07:51:42,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823616842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:42,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:42,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 07:51:42,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298839996] [2024-11-12 07:51:42,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:42,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 07:51:42,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:51:42,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 07:51:42,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:51:42,417 INFO L87 Difference]: Start difference. First operand 866 states and 1206 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:43,153 INFO L93 Difference]: Finished difference Result 967 states and 1331 transitions. [2024-11-12 07:51:43,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:51:43,154 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 106 [2024-11-12 07:51:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:43,156 INFO L225 Difference]: With dead ends: 967 [2024-11-12 07:51:43,156 INFO L226 Difference]: Without dead ends: 965 [2024-11-12 07:51:43,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-11-12 07:51:43,157 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 391 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:43,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 841 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:51:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-11-12 07:51:43,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 945. [2024-11-12 07:51:43,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 902 states have (on average 1.370288248337029) internal successors, (1236), 902 states have internal predecessors, (1236), 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:51:43,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1308 transitions. [2024-11-12 07:51:43,191 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1308 transitions. Word has length 106 [2024-11-12 07:51:43,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:43,191 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1308 transitions. [2024-11-12 07:51:43,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1308 transitions. [2024-11-12 07:51:43,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-12 07:51:43,192 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:43,192 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:43,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-12 07:51:43,192 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:43,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:43,192 INFO L85 PathProgramCache]: Analyzing trace with hash 723465583, now seen corresponding path program 1 times [2024-11-12 07:51:43,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:51:43,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713473691] [2024-11-12 07:51:43,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:43,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:51:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:51:43,235 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:51:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:51:43,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:51:43,313 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:51:43,314 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:51:43,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-12 07:51:43,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:51:43,412 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:51:43,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:51:43 BoogieIcfgContainer [2024-11-12 07:51:43,415 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:51:43,416 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:51:43,416 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:51:43,416 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:51:43,416 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:51:01" (3/4) ... [2024-11-12 07:51:43,418 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:51:43,419 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:51:43,419 INFO L158 Benchmark]: Toolchain (without parser) took 43051.84ms. Allocated memory was 169.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 96.8MB in the beginning and 605.9MB in the end (delta: -509.0MB). Peak memory consumption was 690.1MB. Max. memory is 16.1GB. [2024-11-12 07:51:43,420 INFO L158 Benchmark]: CDTParser took 3.23ms. Allocated memory is still 169.9MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:51:43,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.41ms. Allocated memory is still 169.9MB. Free memory was 96.6MB in the beginning and 139.8MB in the end (delta: -43.1MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2024-11-12 07:51:43,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.80ms. Allocated memory is still 169.9MB. Free memory was 139.8MB in the beginning and 135.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:51:43,422 INFO L158 Benchmark]: Boogie Preprocessor took 73.51ms. Allocated memory is still 169.9MB. Free memory was 135.6MB in the beginning and 131.4MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 07:51:43,422 INFO L158 Benchmark]: RCFGBuilder took 641.75ms. Allocated memory is still 169.9MB. Free memory was 131.4MB in the beginning and 93.6MB in the end (delta: 37.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-12 07:51:43,423 INFO L158 Benchmark]: TraceAbstraction took 41926.28ms. Allocated memory was 169.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 92.6MB in the beginning and 605.9MB in the end (delta: -513.3MB). Peak memory consumption was 683.1MB. Max. memory is 16.1GB. [2024-11-12 07:51:43,423 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 1.4GB. Free memory is still 605.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:51:43,423 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.23ms. Allocated memory is still 169.9MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.41ms. Allocated memory is still 169.9MB. Free memory was 96.6MB in the beginning and 139.8MB in the end (delta: -43.1MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.80ms. Allocated memory is still 169.9MB. Free memory was 139.8MB in the beginning and 135.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.51ms. Allocated memory is still 169.9MB. Free memory was 135.6MB in the beginning and 131.4MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 641.75ms. Allocated memory is still 169.9MB. Free memory was 131.4MB in the beginning and 93.6MB in the end (delta: 37.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 41926.28ms. Allocated memory was 169.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 92.6MB in the beginning and 605.9MB in the end (delta: -513.3MB). Peak memory consumption was 683.1MB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 1.4GB. Free memory is still 605.9MB. 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 113, overapproximation of someUnaryDOUBLEoperation at line 43. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L51] signed short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] signed short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L53] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L54] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L55] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L56] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L57] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L58] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L59] signed long int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L60] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L61] float* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L62] signed long int* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L63] signed long int last_1_WrapperStruct00_var_1_13 = -8; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=0, last_1_WrapperStruct00_var_1_13=-8] [L117] isInitial = 1 [L118] FCALL initially() [L119] COND TRUE 1 [L120] CALL updateLastVariables() [L110] EXPR WrapperStruct00.var_1_13 [L110] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L120] RET updateLastVariables() [L121] CALL updateVariables() [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L94] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L96] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L100] EXPR WrapperStruct00.var_1_10 [L100] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_10 [L100] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L102] EXPR WrapperStruct00.var_1_11 [L102] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_11 [L102] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L103] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L104] EXPR WrapperStruct00.var_1_12 [L104] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_12 [L104] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L105] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L107] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L121] RET updateVariables() [L122] CALL step() [L67] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L67] COND FALSE !((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) [L70] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L70] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L71] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_7_Pointer)); [L72] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L72] COND TRUE ! (*(WrapperStruct00_var_1_14_Pointer)) [L73] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L73] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L81] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_11_Pointer)) [L82] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L82] EXPR (*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L82] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L82] signed long int stepLocal_0 = ((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer)); [L83] COND FALSE !(stepLocal_0 < -1) [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L86] (*(WrapperStruct00_var_1_1_Pointer)) = (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) [L88] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L88] EXPR (*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L88] EXPR (*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L88] COND FALSE !((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) [L122] RET step() [L123] CALL, EXPR property() [L113] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))))) [L113] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1) [L113] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))))) [L113] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))) [L113] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L113] EXPR (! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer)))) [L113] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L113] EXPR ((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113-L114] return (((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) ; [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.8s, OverallIterations: 37, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8478 SdHoareTripleChecker+Valid, 13.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8478 mSDsluCounter, 27737 SdHoareTripleChecker+Invalid, 11.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22635 mSDsCounter, 379 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15840 IncrementalHoareTripleChecker+Invalid, 16219 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 379 mSolverCounterUnsat, 5102 mSDtfsCounter, 15840 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1351 GetRequests, 899 SyntacticMatches, 12 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=945occurred in iteration=36, InterpolantAutomatonStates: 306, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 4235 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 3859 NumberOfCodeBlocks, 3859 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3716 ConstructedInterpolants, 0 QuantifiedInterpolants, 33760 SizeOfPredicates, 9 NumberOfNonLiveVariables, 442 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 37 InterpolantComputations, 35 PerfectInterpolantSequences, 5230/5328 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:51:43,456 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-sp_file-33.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 9fba8bcd82b4a3fe57500a406293d5d51cfc2c8d1877a7a6552e09538ec18fb3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:51:45,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:51:45,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:51:45,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:51:45,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:51:45,693 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:51:45,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:51:45,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:51:45,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:51:45,701 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:51:45,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:51:45,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:51:45,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:51:45,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:51:45,703 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:51:45,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:51:45,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:51:45,703 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:51:45,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:51:45,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:51:45,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:51:45,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:51:45,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:51:45,711 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:51:45,711 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:51:45,712 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:51:45,712 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:51:45,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:51:45,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:51:45,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:51:45,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:51:45,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:51:45,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:51:45,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:51:45,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:51:45,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:51:45,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:51:45,719 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:51:45,719 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:51:45,720 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:51:45,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:51:45,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:51:45,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:51:45,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:51:45,721 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 -> 9fba8bcd82b4a3fe57500a406293d5d51cfc2c8d1877a7a6552e09538ec18fb3 [2024-11-12 07:51:46,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:51:46,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:51:46,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:51:46,236 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:51:46,240 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:51:46,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i [2024-11-12 07:51:48,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:51:48,264 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:51:48,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i [2024-11-12 07:51:48,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9592c420e/0d02568a482c4077aa8f263d121884f4/FLAGfe97a9e13 [2024-11-12 07:51:48,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9592c420e/0d02568a482c4077aa8f263d121884f4 [2024-11-12 07:51:48,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:51:48,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:51:48,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:51:48,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:51:48,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:51:48,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:51:48" (1/1) ... [2024-11-12 07:51:48,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35136968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:48, skipping insertion in model container [2024-11-12 07:51:48,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:51:48" (1/1) ... [2024-11-12 07:51:48,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:51:48,792 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-sp_file-33.i[917,930] [2024-11-12 07:51:48,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:51:48,864 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:51:48,875 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-sp_file-33.i[917,930] [2024-11-12 07:51:48,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:51:48,935 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:51:48,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:48 WrapperNode [2024-11-12 07:51:48,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:51:48,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:51:48,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:51:48,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:51:48,942 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:51:48" (1/1) ... [2024-11-12 07:51:48,958 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:51:48" (1/1) ... [2024-11-12 07:51:48,992 INFO L138 Inliner]: procedures = 37, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2024-11-12 07:51:48,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:51:48,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:51:48,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:51:48,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:51:49,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:48" (1/1) ... [2024-11-12 07:51:49,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:48" (1/1) ... [2024-11-12 07:51:49,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:48" (1/1) ... [2024-11-12 07:51:49,036 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 28 writes are split as follows [0, 28]. [2024-11-12 07:51:49,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:48" (1/1) ... [2024-11-12 07:51:49,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:48" (1/1) ... [2024-11-12 07:51:49,056 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:48" (1/1) ... [2024-11-12 07:51:49,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:48" (1/1) ... [2024-11-12 07:51:49,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:48" (1/1) ... [2024-11-12 07:51:49,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:48" (1/1) ... [2024-11-12 07:51:49,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:51:49,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:51:49,077 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:51:49,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:51:49,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:48" (1/1) ... [2024-11-12 07:51:49,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:51:49,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:51:49,107 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:51:49,113 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:51:49,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:51:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:51:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:51:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:51:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:51:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-12 07:51:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-12 07:51:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:51:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:51:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:51:49,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:51:49,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-12 07:51:49,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-12 07:51:49,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-12 07:51:49,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-12 07:51:49,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-12 07:51:49,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-12 07:51:49,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-12 07:51:49,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-12 07:51:49,190 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:51:49,190 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:51:49,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-12 07:51:49,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-12 07:51:49,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:51:49,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:51:49,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:51:49,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:51:49,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:51:49,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:51:49,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:51:49,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:51:49,371 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:51:49,373 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:51:51,531 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-12 07:51:51,532 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:51:51,545 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:51:51,548 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:51:51,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:51:51 BoogieIcfgContainer [2024-11-12 07:51:51,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:51:51,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:51:51,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:51:51,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:51:51,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:51:48" (1/3) ... [2024-11-12 07:51:51,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bf44bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:51:51, skipping insertion in model container [2024-11-12 07:51:51,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:51:48" (2/3) ... [2024-11-12 07:51:51,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bf44bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:51:51, skipping insertion in model container [2024-11-12 07:51:51,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:51:51" (3/3) ... [2024-11-12 07:51:51,581 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-33.i [2024-11-12 07:51:51,605 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:51:51,608 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:51:51,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:51:51,685 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;@5776a825, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:51:51,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:51:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:51:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 07:51:51,699 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:51,700 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:51,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:51,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:51,704 INFO L85 PathProgramCache]: Analyzing trace with hash -757554800, now seen corresponding path program 1 times [2024-11-12 07:51:51,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:51:51,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977803696] [2024-11-12 07:51:51,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:51,717 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:51:51,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:51:51,720 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:51:51,721 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:51:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:52,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:51:52,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:51:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-12 07:51:52,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:51:52,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:51:52,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977803696] [2024-11-12 07:51:52,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977803696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:52,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:52,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:51:52,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907928595] [2024-11-12 07:51:52,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:52,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:51:52,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:51:52,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:51:52,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:51:52,067 INFO L87 Difference]: Start difference. First operand has 85 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:52,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:52,087 INFO L93 Difference]: Finished difference Result 163 states and 247 transitions. [2024-11-12 07:51:52,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:51:52,089 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-12 07:51:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:52,095 INFO L225 Difference]: With dead ends: 163 [2024-11-12 07:51:52,095 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 07:51:52,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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:51:52,101 INFO L435 NwaCegarLoop]: 115 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, 115 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:51:52,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:51:52,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 07:51:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-12 07:51:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:51:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-11-12 07:51:52,133 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 92 [2024-11-12 07:51:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:52,137 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-11-12 07:51:52,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-12 07:51:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 07:51:52,141 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:52,141 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:52,153 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:51:52,342 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:51:52,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:52,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:52,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1180114542, now seen corresponding path program 1 times [2024-11-12 07:51:52,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:51:52,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473373254] [2024-11-12 07:51:52,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:52,344 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:51:52,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:51:52,347 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:51:52,348 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:51:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:52,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:51:52,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:51:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-12 07:51:52,650 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:51:52,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:51:52,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473373254] [2024-11-12 07:51:52,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473373254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:52,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:52,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:51:52,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861662119] [2024-11-12 07:51:52,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:52,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:51:52,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:51:52,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:51:52,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:51:52,654 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:52,692 INFO L93 Difference]: Finished difference Result 161 states and 230 transitions. [2024-11-12 07:51:52,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:51:52,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-12 07:51:52,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:52,695 INFO L225 Difference]: With dead ends: 161 [2024-11-12 07:51:52,695 INFO L226 Difference]: Without dead ends: 83 [2024-11-12 07:51:52,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 89 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:51:52,696 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 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:51:52,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:51:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-12 07:51:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-12 07:51:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:51:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2024-11-12 07:51:52,703 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 92 [2024-11-12 07:51:52,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:52,704 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2024-11-12 07:51:52,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:51:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2024-11-12 07:51:52,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 07:51:52,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:52,706 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:52,715 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:51:52,909 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:51:52,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:51:52,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:51:52,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2073600880, now seen corresponding path program 1 times [2024-11-12 07:51:52,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:51:52,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191984309] [2024-11-12 07:51:52,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:51:52,911 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:51:52,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:51:52,930 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:51:52,931 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:51:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:51:53,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:51:53,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:51:53,185 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 12 treesize of output 8 [2024-11-12 07:51:53,236 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 37 treesize of output 25 [2024-11-12 07:51:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:51:53,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:51:53,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:51:53,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191984309] [2024-11-12 07:51:53,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191984309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:51:53,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:51:53,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:51:53,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095350892] [2024-11-12 07:51:53,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:51:53,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:51:53,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:51:53,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:51:53,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:51:53,257 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:51:59,820 INFO L93 Difference]: Finished difference Result 199 states and 281 transitions. [2024-11-12 07:51:59,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:51:59,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-12 07:51:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:51:59,822 INFO L225 Difference]: With dead ends: 199 [2024-11-12 07:51:59,822 INFO L226 Difference]: Without dead ends: 119 [2024-11-12 07:51:59,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 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:51:59,823 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 44 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:51:59,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 336 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-12 07:51:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-12 07:51:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 89. [2024-11-12 07:51:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 78 states have internal predecessors, (107), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:51:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2024-11-12 07:51:59,840 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 92 [2024-11-12 07:51:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:51:59,841 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2024-11-12 07:51:59,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:51:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2024-11-12 07:51:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 07:51:59,842 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:51:59,842 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:59,852 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:52:00,042 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:52:00,043 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:00,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:00,044 INFO L85 PathProgramCache]: Analyzing trace with hash 941502738, now seen corresponding path program 1 times [2024-11-12 07:52:00,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:00,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553217733] [2024-11-12 07:52:00,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:00,045 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:52:00,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:00,049 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:52:00,054 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:52:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:00,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 07:52:00,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:52:00,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:52:00,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:00,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553217733] [2024-11-12 07:52:00,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553217733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:00,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:00,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:52:00,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617756961] [2024-11-12 07:52:00,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:00,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:52:00,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:00,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:52:00,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:52:00,330 INFO L87 Difference]: Start difference. First operand 89 states and 125 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:52:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:00,405 INFO L93 Difference]: Finished difference Result 182 states and 257 transitions. [2024-11-12 07:52:00,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:52:00,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-12 07:52:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:00,407 INFO L225 Difference]: With dead ends: 182 [2024-11-12 07:52:00,407 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 07:52:00,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 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:52:00,408 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:00,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 519 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:52:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 07:52:00,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-12 07:52:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:52:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2024-11-12 07:52:00,414 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 92 [2024-11-12 07:52:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:00,414 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2024-11-12 07:52:00,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:52:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2024-11-12 07:52:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 07:52:00,416 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:00,416 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:00,424 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:52:00,616 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:52:00,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:00,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:00,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1578457196, now seen corresponding path program 1 times [2024-11-12 07:52:00,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:00,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291486903] [2024-11-12 07:52:00,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:00,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:52:00,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:00,623 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:52:00,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 07:52:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:00,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 07:52:00,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:52:00,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:52:00,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:00,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291486903] [2024-11-12 07:52:00,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291486903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:00,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:00,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:52:00,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836588557] [2024-11-12 07:52:00,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:00,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:52:00,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:00,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:52:00,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:52:00,917 INFO L87 Difference]: Start difference. First operand 95 states and 131 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:52:01,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:01,006 INFO L93 Difference]: Finished difference Result 190 states and 263 transitions. [2024-11-12 07:52:01,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:52:01,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-12 07:52:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:01,007 INFO L225 Difference]: With dead ends: 190 [2024-11-12 07:52:01,007 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 07:52:01,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 86 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:52:01,008 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:01,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 616 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:52:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 07:52:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-12 07:52:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:52:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2024-11-12 07:52:01,014 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 92 [2024-11-12 07:52:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:01,016 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2024-11-12 07:52:01,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:52:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2024-11-12 07:52:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 07:52:01,018 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:01,018 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:01,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 07:52:01,219 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:52:01,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:01,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:01,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1576610154, now seen corresponding path program 1 times [2024-11-12 07:52:01,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:01,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689448628] [2024-11-12 07:52:01,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:01,221 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:52:01,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:01,223 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:52:01,224 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:52:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:01,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:52:01,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:01,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-12 07:52:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-12 07:52:01,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:52:01,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:01,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689448628] [2024-11-12 07:52:01,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689448628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:01,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:01,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:52:01,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709437796] [2024-11-12 07:52:01,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:01,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:52:01,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:01,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:52:01,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:52:01,653 INFO L87 Difference]: Start difference. First operand 97 states and 133 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:52:03,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:52:04,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:52:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:06,342 INFO L93 Difference]: Finished difference Result 192 states and 264 transitions. [2024-11-12 07:52:06,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:52:06,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-12 07:52:06,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:06,344 INFO L225 Difference]: With dead ends: 192 [2024-11-12 07:52:06,345 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 07:52:06,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:52:06,347 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 89 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:06,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 329 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-12 07:52:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 07:52:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-12 07:52:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 86 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:52:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 132 transitions. [2024-11-12 07:52:06,356 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 132 transitions. Word has length 92 [2024-11-12 07:52:06,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:06,357 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 132 transitions. [2024-11-12 07:52:06,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:52:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 132 transitions. [2024-11-12 07:52:06,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 07:52:06,358 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:06,358 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:06,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-12 07:52:06,558 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:52:06,559 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:06,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:06,559 INFO L85 PathProgramCache]: Analyzing trace with hash 549285136, now seen corresponding path program 1 times [2024-11-12 07:52:06,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:06,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549606056] [2024-11-12 07:52:06,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:06,560 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:52:06,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:06,563 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:52:06,563 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:52:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:06,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:52:06,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:06,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-12 07:52:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-12 07:52:06,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:52:06,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:06,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549606056] [2024-11-12 07:52:06,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549606056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:06,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:06,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:52:06,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886779938] [2024-11-12 07:52:06,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:06,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:52:06,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:06,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:52:06,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:52:06,916 INFO L87 Difference]: Start difference. First operand 97 states and 132 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:52:08,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:52:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:10,751 INFO L93 Difference]: Finished difference Result 191 states and 261 transitions. [2024-11-12 07:52:10,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:52:10,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2024-11-12 07:52:10,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:10,757 INFO L225 Difference]: With dead ends: 191 [2024-11-12 07:52:10,757 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 07:52:10,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:52:10,758 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 80 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:10,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 325 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-12 07:52:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 07:52:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-11-12 07:52:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 84 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:52:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2024-11-12 07:52:10,762 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 94 [2024-11-12 07:52:10,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:10,763 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2024-11-12 07:52:10,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:52:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2024-11-12 07:52:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:52:10,764 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:10,764 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:10,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 07:52:10,967 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:52:10,968 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:10,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:10,968 INFO L85 PathProgramCache]: Analyzing trace with hash -32472104, now seen corresponding path program 1 times [2024-11-12 07:52:10,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:10,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751681329] [2024-11-12 07:52:10,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:10,969 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:52:10,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:10,971 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:52:10,972 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:52:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:11,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:52:11,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:11,437 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 94 treesize of output 40 [2024-11-12 07:52:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 24 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-12 07:52:11,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:52:11,664 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 58 treesize of output 22 [2024-11-12 07:52:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 07:52:11,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:11,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751681329] [2024-11-12 07:52:11,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751681329] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:52:11,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:52:11,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-12 07:52:11,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935510834] [2024-11-12 07:52:11,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:52:11,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:52:11,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:11,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:52:11,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:52:11,692 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-12 07:52:18,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:18,534 INFO L93 Difference]: Finished difference Result 200 states and 270 transitions. [2024-11-12 07:52:18,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 07:52:18,535 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 96 [2024-11-12 07:52:18,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:18,536 INFO L225 Difference]: With dead ends: 200 [2024-11-12 07:52:18,536 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 07:52:18,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:52:18,537 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 83 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:18,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 534 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-12 07:52:18,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 07:52:18,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-11-12 07:52:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:52:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 127 transitions. [2024-11-12 07:52:18,548 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 127 transitions. Word has length 96 [2024-11-12 07:52:18,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:18,549 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 127 transitions. [2024-11-12 07:52:18,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-12 07:52:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2024-11-12 07:52:18,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:52:18,558 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:18,558 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:18,573 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 (9)] Forceful destruction successful, exit code 0 [2024-11-12 07:52:18,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:52:18,759 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:18,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:18,759 INFO L85 PathProgramCache]: Analyzing trace with hash 320616278, now seen corresponding path program 1 times [2024-11-12 07:52:18,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:18,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325639280] [2024-11-12 07:52:18,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:18,760 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:52:18,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:18,763 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:52:18,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 07:52:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:19,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 07:52:19,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:19,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:52:19,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-12 07:52:19,343 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 0 case distinctions, treesize of input 41 treesize of output 28 [2024-11-12 07:52:19,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2024-11-12 07:52:20,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2024-11-12 07:52:20,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2024-11-12 07:52:20,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2024-11-12 07:52:20,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:52:20,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 41