./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.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 d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:10:28,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:10:28,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:10:28,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:10:28,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:10:28,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:10:28,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:10:28,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:10:28,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:10:28,353 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:10:28,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:10:28,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:10:28,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:10:28,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:10:28,367 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:10:28,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:10:28,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:10:28,368 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:10:28,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:10:28,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:10:28,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:10:28,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:10:28,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:10:28,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:10:28,370 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:10:28,370 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:10:28,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:10:28,370 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:10:28,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:10:28,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:10:28,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:10:28,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:10:28,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:10:28,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:10:28,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:10:28,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:10:28,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:10:28,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:10:28,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:10:28,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:10:28,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:10:28,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:10:28,374 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 -> d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 [2024-11-20 09:10:28,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:10:28,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:10:28,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:10:28,587 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:10:28,587 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:10:28,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2024-11-20 09:10:29,781 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:10:29,936 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:10:29,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2024-11-20 09:10:29,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61947ce2a/de7583fed10f4423bdc3a602c191c030/FLAG2751c2243 [2024-11-20 09:10:30,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61947ce2a/de7583fed10f4423bdc3a602c191c030 [2024-11-20 09:10:30,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:10:30,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:10:30,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:10:30,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:10:30,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:10:30,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:10:30" (1/1) ... [2024-11-20 09:10:30,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d9f20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:10:30, skipping insertion in model container [2024-11-20 09:10:30,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:10:30" (1/1) ... [2024-11-20 09:10:30,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:10:30,520 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-70.i[917,930] [2024-11-20 09:10:30,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:10:30,582 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:10:30,591 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-70.i[917,930] [2024-11-20 09:10:30,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:10:30,636 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:10:30,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:10:30 WrapperNode [2024-11-20 09:10:30,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:10:30,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:10:30,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:10:30,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:10:30,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:10:30" (1/1) ... [2024-11-20 09:10:30,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:10:30" (1/1) ... [2024-11-20 09:10:30,696 INFO L138 Inliner]: procedures = 30, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 530 [2024-11-20 09:10:30,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:10:30,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:10:30,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:10:30,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:10:30,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:10:30" (1/1) ... [2024-11-20 09:10:30,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:10:30" (1/1) ... [2024-11-20 09:10:30,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:10:30" (1/1) ... [2024-11-20 09:10:30,722 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-20 09:10:30,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:10:30" (1/1) ... [2024-11-20 09:10:30,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:10:30" (1/1) ... [2024-11-20 09:10:30,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:10:30" (1/1) ... [2024-11-20 09:10:30,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:10:30" (1/1) ... [2024-11-20 09:10:30,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:10:30" (1/1) ... [2024-11-20 09:10:30,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:10:30" (1/1) ... [2024-11-20 09:10:30,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:10:30,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:10:30,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:10:30,763 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:10:30,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:10:30" (1/1) ... [2024-11-20 09:10:30,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:10:30,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:10:30,793 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-20 09:10:30,797 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-20 09:10:30,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:10:30,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-20 09:10:30,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-20 09:10:30,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-20 09:10:30,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 09:10:30,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-20 09:10:30,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 09:10:30,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:10:30,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:10:30,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 09:10:30,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:10:30,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:10:30,922 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:10:30,924 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:10:31,429 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-11-20 09:10:31,429 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:10:31,443 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:10:31,443 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:10:31,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:10:31 BoogieIcfgContainer [2024-11-20 09:10:31,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:10:31,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:10:31,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:10:31,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:10:31,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:10:30" (1/3) ... [2024-11-20 09:10:31,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c96096d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:10:31, skipping insertion in model container [2024-11-20 09:10:31,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:10:30" (2/3) ... [2024-11-20 09:10:31,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c96096d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:10:31, skipping insertion in model container [2024-11-20 09:10:31,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:10:31" (3/3) ... [2024-11-20 09:10:31,452 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-70.i [2024-11-20 09:10:31,465 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:10:31,465 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:10:31,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:10:31,518 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;@3c32a6bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:10:31,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:10:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 09:10:31,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:31,533 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:31,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:31,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:31,539 INFO L85 PathProgramCache]: Analyzing trace with hash 321983463, now seen corresponding path program 1 times [2024-11-20 09:10:31,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:31,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513846783] [2024-11-20 09:10:31,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:31,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:10:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:10:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:10:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:10:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:10:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:10:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:10:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:10:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:10:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:10:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:10:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:10:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:10:32,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:10:32,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513846783] [2024-11-20 09:10:32,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513846783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:10:32,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:10:32,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:10:32,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393196545] [2024-11-20 09:10:32,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:10:32,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:10:32,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:10:32,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:10:32,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:10:32,256 INFO L87 Difference]: Start difference. First operand has 111 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:10:32,317 INFO L93 Difference]: Finished difference Result 217 states and 333 transitions. [2024-11-20 09:10:32,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:10:32,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-20 09:10:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:10:32,329 INFO L225 Difference]: With dead ends: 217 [2024-11-20 09:10:32,329 INFO L226 Difference]: Without dead ends: 109 [2024-11-20 09:10:32,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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-20 09:10:32,337 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:10:32,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:10:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-20 09:10:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-20 09:10:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:32,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-20 09:10:32,368 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 116 [2024-11-20 09:10:32,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:10:32,369 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-20 09:10:32,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:32,370 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-20 09:10:32,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 09:10:32,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:32,372 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:32,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:10:32,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:32,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:32,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1438106206, now seen corresponding path program 1 times [2024-11-20 09:10:32,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:32,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585988323] [2024-11-20 09:10:32,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:32,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:10:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:10:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:10:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:10:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:10:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:10:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:10:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:10:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:10:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:10:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:10:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:10:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:10:32,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:10:32,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585988323] [2024-11-20 09:10:32,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585988323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:10:32,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:10:32,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:10:32,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964666090] [2024-11-20 09:10:32,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:10:32,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:10:32,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:10:32,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:10:32,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:10:32,601 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:32,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:10:32,634 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2024-11-20 09:10:32,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:10:32,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-20 09:10:32,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:10:32,636 INFO L225 Difference]: With dead ends: 218 [2024-11-20 09:10:32,636 INFO L226 Difference]: Without dead ends: 112 [2024-11-20 09:10:32,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-20 09:10:32,638 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:10:32,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:10:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-20 09:10:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-20 09:10:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-20 09:10:32,645 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 118 [2024-11-20 09:10:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:10:32,646 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-20 09:10:32,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-20 09:10:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 09:10:32,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:32,647 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:32,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:10:32,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:32,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:32,648 INFO L85 PathProgramCache]: Analyzing trace with hash 336901156, now seen corresponding path program 1 times [2024-11-20 09:10:32,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:32,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039725104] [2024-11-20 09:10:32,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:32,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:10:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:10:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:10:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:10:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:10:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:10:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:10:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:10:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:10:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:10:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:10:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:10:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:10:32,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:10:32,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039725104] [2024-11-20 09:10:32,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039725104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:10:32,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:10:32,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:10:32,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057184734] [2024-11-20 09:10:32,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:10:32,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:10:32,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:10:32,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:10:32,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:10:32,831 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:32,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:10:32,864 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-20 09:10:32,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:10:32,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-20 09:10:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:10:32,869 INFO L225 Difference]: With dead ends: 222 [2024-11-20 09:10:32,869 INFO L226 Difference]: Without dead ends: 114 [2024-11-20 09:10:32,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-20 09:10:32,871 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:10:32,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:10:32,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-20 09:10:32,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-20 09:10:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-20 09:10:32,881 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 118 [2024-11-20 09:10:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:10:32,882 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-20 09:10:32,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-20 09:10:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 09:10:32,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:32,884 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:32,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:10:32,884 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:32,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:32,885 INFO L85 PathProgramCache]: Analyzing trace with hash 338748198, now seen corresponding path program 1 times [2024-11-20 09:10:32,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:32,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131898249] [2024-11-20 09:10:32,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:32,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:10:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:10:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:10:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:10:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:10:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:10:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:10:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:10:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:10:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:10:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:10:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:10:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:10:33,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:10:33,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131898249] [2024-11-20 09:10:33,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131898249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:10:33,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:10:33,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:10:33,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349171520] [2024-11-20 09:10:33,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:10:33,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:10:33,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:10:33,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:10:33,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:10:33,256 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:10:33,425 INFO L93 Difference]: Finished difference Result 239 states and 343 transitions. [2024-11-20 09:10:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:10:33,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-20 09:10:33,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:10:33,427 INFO L225 Difference]: With dead ends: 239 [2024-11-20 09:10:33,427 INFO L226 Difference]: Without dead ends: 129 [2024-11-20 09:10:33,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:10:33,429 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 20 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:10:33,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 486 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 09:10:33,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-20 09:10:33,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 116. [2024-11-20 09:10:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2024-11-20 09:10:33,441 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 118 [2024-11-20 09:10:33,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:10:33,441 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2024-11-20 09:10:33,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:33,442 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2024-11-20 09:10:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 09:10:33,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:33,443 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:33,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:10:33,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:33,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:33,444 INFO L85 PathProgramCache]: Analyzing trace with hash 541336422, now seen corresponding path program 1 times [2024-11-20 09:10:33,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:33,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627135362] [2024-11-20 09:10:33,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:33,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:10:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:10:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:10:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:10:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:10:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:10:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:10:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:10:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:10:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:10:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:10:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:10:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:10:33,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:10:33,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627135362] [2024-11-20 09:10:33,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627135362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:10:33,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:10:33,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:10:33,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806106273] [2024-11-20 09:10:33,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:10:33,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:10:33,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:10:33,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:10:33,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:10:33,659 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:10:33,687 INFO L93 Difference]: Finished difference Result 229 states and 325 transitions. [2024-11-20 09:10:33,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:10:33,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-20 09:10:33,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:10:33,689 INFO L225 Difference]: With dead ends: 229 [2024-11-20 09:10:33,692 INFO L226 Difference]: Without dead ends: 116 [2024-11-20 09:10:33,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-20 09:10:33,693 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 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-20 09:10:33,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:10:33,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-20 09:10:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-20 09:10:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 102 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:33,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 163 transitions. [2024-11-20 09:10:33,706 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 163 transitions. Word has length 118 [2024-11-20 09:10:33,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:10:33,706 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 163 transitions. [2024-11-20 09:10:33,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:33,706 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 163 transitions. [2024-11-20 09:10:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 09:10:33,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:33,709 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:33,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:10:33,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:33,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:33,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1190083871, now seen corresponding path program 1 times [2024-11-20 09:10:33,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:33,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292341921] [2024-11-20 09:10:33,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:33,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:10:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:10:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:10:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:10:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:10:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:10:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:10:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:10:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:10:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:10:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:10:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:10:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:10:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:10:34,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292341921] [2024-11-20 09:10:34,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292341921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:10:34,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:10:34,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 09:10:34,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542036475] [2024-11-20 09:10:34,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:10:34,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 09:10:34,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:10:34,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 09:10:34,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:10:34,361 INFO L87 Difference]: Start difference. First operand 116 states and 163 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:10:34,661 INFO L93 Difference]: Finished difference Result 281 states and 393 transitions. [2024-11-20 09:10:34,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:10:34,662 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-20 09:10:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:10:34,662 INFO L225 Difference]: With dead ends: 281 [2024-11-20 09:10:34,663 INFO L226 Difference]: Without dead ends: 168 [2024-11-20 09:10:34,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:10:34,664 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 279 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 09:10:34,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 476 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 09:10:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-20 09:10:34,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 131. [2024-11-20 09:10:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 117 states have (on average 1.358974358974359) internal successors, (159), 117 states have internal predecessors, (159), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 183 transitions. [2024-11-20 09:10:34,683 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 183 transitions. Word has length 120 [2024-11-20 09:10:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:10:34,683 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 183 transitions. [2024-11-20 09:10:34,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 183 transitions. [2024-11-20 09:10:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-20 09:10:34,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:34,684 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:34,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:10:34,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:34,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:34,685 INFO L85 PathProgramCache]: Analyzing trace with hash -756160283, now seen corresponding path program 1 times [2024-11-20 09:10:34,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:34,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203550444] [2024-11-20 09:10:34,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:34,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:10:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:10:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:10:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:10:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:10:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:10:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:10:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:10:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:10:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:10:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:10:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:10:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:34,995 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:10:34,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:10:34,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203550444] [2024-11-20 09:10:34,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203550444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:10:34,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:10:34,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:10:34,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354670008] [2024-11-20 09:10:34,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:10:34,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:10:34,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:10:34,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:10:34,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:10:34,999 INFO L87 Difference]: Start difference. First operand 131 states and 183 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:35,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:10:35,184 INFO L93 Difference]: Finished difference Result 295 states and 412 transitions. [2024-11-20 09:10:35,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:10:35,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-20 09:10:35,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:10:35,185 INFO L225 Difference]: With dead ends: 295 [2024-11-20 09:10:35,185 INFO L226 Difference]: Without dead ends: 167 [2024-11-20 09:10:35,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:10:35,186 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 44 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:10:35,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 477 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:10:35,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-20 09:10:35,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 133. [2024-11-20 09:10:35,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.3529411764705883) internal successors, (161), 119 states have internal predecessors, (161), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 185 transitions. [2024-11-20 09:10:35,200 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 185 transitions. Word has length 121 [2024-11-20 09:10:35,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:10:35,201 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 185 transitions. [2024-11-20 09:10:35,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:35,201 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 185 transitions. [2024-11-20 09:10:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-20 09:10:35,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:35,203 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:35,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:10:35,203 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:35,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:35,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1247826085, now seen corresponding path program 1 times [2024-11-20 09:10:35,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:35,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7568843] [2024-11-20 09:10:35,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:35,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:10:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:10:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:10:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:10:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:10:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:10:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:10:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:10:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:10:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:10:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:10:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:10:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:10:35,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:10:35,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7568843] [2024-11-20 09:10:35,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7568843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:10:35,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:10:35,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:10:35,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144738846] [2024-11-20 09:10:35,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:10:35,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:10:35,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:10:35,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:10:35,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:10:35,366 INFO L87 Difference]: Start difference. First operand 133 states and 185 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:35,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:10:35,390 INFO L93 Difference]: Finished difference Result 266 states and 371 transitions. [2024-11-20 09:10:35,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:10:35,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-20 09:10:35,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:10:35,392 INFO L225 Difference]: With dead ends: 266 [2024-11-20 09:10:35,392 INFO L226 Difference]: Without dead ends: 136 [2024-11-20 09:10:35,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-20 09:10:35,393 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 587 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-20 09:10:35,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 587 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:10:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-20 09:10:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-20 09:10:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2024-11-20 09:10:35,403 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 121 [2024-11-20 09:10:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:10:35,404 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2024-11-20 09:10:35,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2024-11-20 09:10:35,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-20 09:10:35,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:35,406 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:35,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:10:35,406 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:35,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:35,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1101933798, now seen corresponding path program 1 times [2024-11-20 09:10:35,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:35,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491776278] [2024-11-20 09:10:35,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:35,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:10:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:10:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:10:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:10:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:10:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:10:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:10:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:10:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:10:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:10:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:10:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:10:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:10:35,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:10:35,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491776278] [2024-11-20 09:10:35,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491776278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:10:35,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:10:35,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:10:35,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156623513] [2024-11-20 09:10:35,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:10:35,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:10:35,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:10:35,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:10:35,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:10:35,620 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:35,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:10:35,631 INFO L93 Difference]: Finished difference Result 269 states and 373 transitions. [2024-11-20 09:10:35,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:10:35,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-20 09:10:35,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:10:35,635 INFO L225 Difference]: With dead ends: 269 [2024-11-20 09:10:35,635 INFO L226 Difference]: Without dead ends: 136 [2024-11-20 09:10:35,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-20 09:10:35,636 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:10:35,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:10:35,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-20 09:10:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-20 09:10:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 122 states have internal predecessors, (162), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 186 transitions. [2024-11-20 09:10:35,643 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 186 transitions. Word has length 122 [2024-11-20 09:10:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:10:35,643 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 186 transitions. [2024-11-20 09:10:35,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:35,644 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 186 transitions. [2024-11-20 09:10:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-20 09:10:35,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:35,645 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:35,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 09:10:35,645 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:35,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:35,646 INFO L85 PathProgramCache]: Analyzing trace with hash -587009944, now seen corresponding path program 1 times [2024-11-20 09:10:35,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:35,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058653924] [2024-11-20 09:10:35,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:35,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:36,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:10:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:36,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:10:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:36,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:10:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:36,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:10:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:36,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:10:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:36,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:10:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:36,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:10:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:36,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:10:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:36,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:10:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:36,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:10:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:36,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:10:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:36,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:10:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:10:36,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:10:36,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058653924] [2024-11-20 09:10:36,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058653924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:10:36,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:10:36,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 09:10:36,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425840670] [2024-11-20 09:10:36,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:10:36,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 09:10:36,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:10:36,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 09:10:36,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:10:36,529 INFO L87 Difference]: Start difference. First operand 136 states and 186 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:36,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:10:36,802 INFO L93 Difference]: Finished difference Result 334 states and 455 transitions. [2024-11-20 09:10:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:10:36,802 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-20 09:10:36,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:10:36,803 INFO L225 Difference]: With dead ends: 334 [2024-11-20 09:10:36,803 INFO L226 Difference]: Without dead ends: 201 [2024-11-20 09:10:36,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:10:36,804 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 333 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:10:36,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 478 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:10:36,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-20 09:10:36,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 156. [2024-11-20 09:10:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 142 states have (on average 1.3309859154929577) internal successors, (189), 142 states have internal predecessors, (189), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 213 transitions. [2024-11-20 09:10:36,812 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 213 transitions. Word has length 122 [2024-11-20 09:10:36,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:10:36,812 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 213 transitions. [2024-11-20 09:10:36,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 213 transitions. [2024-11-20 09:10:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-20 09:10:36,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:36,813 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:36,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 09:10:36,814 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:36,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:36,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1608078298, now seen corresponding path program 1 times [2024-11-20 09:10:36,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:36,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637889103] [2024-11-20 09:10:36,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:36,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:38,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:10:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:38,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:10:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:38,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:10:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:38,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:10:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:38,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:10:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:38,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:10:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:38,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:10:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:38,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:10:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:38,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:10:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:38,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:10:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:38,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:10:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:38,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:10:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:10:38,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:10:38,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637889103] [2024-11-20 09:10:38,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637889103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:10:38,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:10:38,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 09:10:38,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622088230] [2024-11-20 09:10:38,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:10:38,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 09:10:38,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:10:38,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 09:10:38,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:10:38,475 INFO L87 Difference]: Start difference. First operand 156 states and 213 transitions. Second operand has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-20 09:10:39,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:10:39,171 INFO L93 Difference]: Finished difference Result 309 states and 423 transitions. [2024-11-20 09:10:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 09:10:39,173 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 122 [2024-11-20 09:10:39,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:10:39,174 INFO L225 Difference]: With dead ends: 309 [2024-11-20 09:10:39,174 INFO L226 Difference]: Without dead ends: 156 [2024-11-20 09:10:39,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-20 09:10:39,175 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 133 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:10:39,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 586 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:10:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-20 09:10:39,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2024-11-20 09:10:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 141 states have (on average 1.326241134751773) internal successors, (187), 141 states have internal predecessors, (187), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 211 transitions. [2024-11-20 09:10:39,185 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 211 transitions. Word has length 122 [2024-11-20 09:10:39,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:10:39,185 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 211 transitions. [2024-11-20 09:10:39,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-20 09:10:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 211 transitions. [2024-11-20 09:10:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-20 09:10:39,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:39,187 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:39,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 09:10:39,187 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:39,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash 315149736, now seen corresponding path program 1 times [2024-11-20 09:10:39,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:39,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456811835] [2024-11-20 09:10:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:43,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:10:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:43,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:10:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:43,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:10:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:43,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:10:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:43,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:10:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:43,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:10:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:43,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:10:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:43,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:10:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:43,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:10:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:43,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:10:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:43,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:10:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:43,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:10:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:10:43,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:10:43,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456811835] [2024-11-20 09:10:43,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456811835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:10:43,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:10:43,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-20 09:10:43,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429409685] [2024-11-20 09:10:43,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:10:43,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-20 09:10:43,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:10:43,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-20 09:10:43,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-20 09:10:43,609 INFO L87 Difference]: Start difference. First operand 155 states and 211 transitions. Second operand has 21 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-20 09:10:46,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:10:46,531 INFO L93 Difference]: Finished difference Result 409 states and 551 transitions. [2024-11-20 09:10:46,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 09:10:46,532 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 122 [2024-11-20 09:10:46,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:10:46,533 INFO L225 Difference]: With dead ends: 409 [2024-11-20 09:10:46,533 INFO L226 Difference]: Without dead ends: 257 [2024-11-20 09:10:46,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=219, Invalid=1041, Unknown=0, NotChecked=0, Total=1260 [2024-11-20 09:10:46,534 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 498 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 09:10:46,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1625 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 09:10:46,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-20 09:10:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 170. [2024-11-20 09:10:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 156 states have (on average 1.3205128205128205) internal successors, (206), 156 states have internal predecessors, (206), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 230 transitions. [2024-11-20 09:10:46,545 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 230 transitions. Word has length 122 [2024-11-20 09:10:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:10:46,545 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 230 transitions. [2024-11-20 09:10:46,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-20 09:10:46,545 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 230 transitions. [2024-11-20 09:10:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-20 09:10:46,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:46,546 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:46,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 09:10:46,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:46,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:46,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1288609818, now seen corresponding path program 1 times [2024-11-20 09:10:46,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:46,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326425155] [2024-11-20 09:10:46,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:46,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:48,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:10:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:48,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:10:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:48,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:10:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:48,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:10:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:48,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:10:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:48,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:10:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:48,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:10:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:48,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:10:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:48,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:10:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:48,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:10:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:48,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:10:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:48,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:10:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:10:48,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:10:48,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326425155] [2024-11-20 09:10:48,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326425155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:10:48,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:10:48,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-20 09:10:48,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935474781] [2024-11-20 09:10:48,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:10:48,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 09:10:48,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:10:48,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 09:10:48,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-20 09:10:48,321 INFO L87 Difference]: Start difference. First operand 170 states and 230 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:10:49,703 INFO L93 Difference]: Finished difference Result 442 states and 594 transitions. [2024-11-20 09:10:49,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 09:10:49,703 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-20 09:10:49,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:10:49,704 INFO L225 Difference]: With dead ends: 442 [2024-11-20 09:10:49,705 INFO L226 Difference]: Without dead ends: 275 [2024-11-20 09:10:49,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2024-11-20 09:10:49,708 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 451 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 09:10:49,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 1292 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 09:10:49,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-20 09:10:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 182. [2024-11-20 09:10:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 168 states have (on average 1.3273809523809523) internal successors, (223), 168 states have internal predecessors, (223), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 247 transitions. [2024-11-20 09:10:49,719 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 247 transitions. Word has length 122 [2024-11-20 09:10:49,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:10:49,719 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 247 transitions. [2024-11-20 09:10:49,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 247 transitions. [2024-11-20 09:10:49,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-20 09:10:49,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:49,721 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:49,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 09:10:49,721 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:49,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1985289124, now seen corresponding path program 1 times [2024-11-20 09:10:49,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:49,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089312761] [2024-11-20 09:10:49,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:50,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:10:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:50,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:10:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:50,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:10:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:50,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:10:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:10:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:50,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:10:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:50,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:10:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:50,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:10:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:50,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:10:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:50,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:10:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:50,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:10:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:50,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:10:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:10:50,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:10:50,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089312761] [2024-11-20 09:10:50,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089312761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:10:50,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:10:50,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 09:10:50,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932608645] [2024-11-20 09:10:50,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:10:50,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 09:10:50,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:10:50,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 09:10:50,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:10:50,408 INFO L87 Difference]: Start difference. First operand 182 states and 247 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:10:50,840 INFO L93 Difference]: Finished difference Result 409 states and 552 transitions. [2024-11-20 09:10:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:10:50,840 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-20 09:10:50,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:10:50,841 INFO L225 Difference]: With dead ends: 409 [2024-11-20 09:10:50,842 INFO L226 Difference]: Without dead ends: 230 [2024-11-20 09:10:50,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:10:50,842 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 241 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 09:10:50,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 691 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 09:10:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-20 09:10:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 182. [2024-11-20 09:10:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 168 states have (on average 1.3154761904761905) internal successors, (221), 168 states have internal predecessors, (221), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 245 transitions. [2024-11-20 09:10:50,852 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 245 transitions. Word has length 122 [2024-11-20 09:10:50,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:10:50,852 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 245 transitions. [2024-11-20 09:10:50,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 245 transitions. [2024-11-20 09:10:50,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 09:10:50,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:50,853 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:50,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 09:10:50,853 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:50,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:50,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2094466316, now seen corresponding path program 1 times [2024-11-20 09:10:50,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:50,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205929453] [2024-11-20 09:10:50,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:50,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:51,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:10:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:51,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:10:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:51,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:10:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:51,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:10:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:51,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:10:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:51,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:10:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:51,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:10:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:51,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:10:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:51,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:10:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:51,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:10:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:51,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:10:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:51,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:10:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:10:51,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:10:51,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205929453] [2024-11-20 09:10:51,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205929453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:10:51,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:10:51,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:10:51,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401152793] [2024-11-20 09:10:51,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:10:51,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:10:51,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:10:51,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:10:51,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:10:51,153 INFO L87 Difference]: Start difference. First operand 182 states and 245 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:10:51,394 INFO L93 Difference]: Finished difference Result 370 states and 499 transitions. [2024-11-20 09:10:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:10:51,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2024-11-20 09:10:51,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:10:51,395 INFO L225 Difference]: With dead ends: 370 [2024-11-20 09:10:51,395 INFO L226 Difference]: Without dead ends: 191 [2024-11-20 09:10:51,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:10:51,396 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 9 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:10:51,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 368 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:10:51,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-20 09:10:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 184. [2024-11-20 09:10:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 170 states have (on average 1.3) internal successors, (221), 170 states have internal predecessors, (221), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:51,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 245 transitions. [2024-11-20 09:10:51,407 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 245 transitions. Word has length 123 [2024-11-20 09:10:51,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:10:51,408 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 245 transitions. [2024-11-20 09:10:51,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:10:51,408 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 245 transitions. [2024-11-20 09:10:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 09:10:51,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:51,408 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:51,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 09:10:51,409 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:51,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:51,409 INFO L85 PathProgramCache]: Analyzing trace with hash 882604046, now seen corresponding path program 1 times [2024-11-20 09:10:51,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:51,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341909727] [2024-11-20 09:10:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:51,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:56,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:10:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:56,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:10:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:56,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:10:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:56,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:10:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:56,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:10:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:56,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:10:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:56,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:10:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:56,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:10:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:56,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:10:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:56,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:10:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:56,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:10:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:56,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:10:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:10:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:10:56,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:10:56,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341909727] [2024-11-20 09:10:56,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341909727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:10:56,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:10:56,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-20 09:10:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259375841] [2024-11-20 09:10:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:10:56,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-20 09:10:56,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:10:56,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-20 09:10:56,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-20 09:10:56,252 INFO L87 Difference]: Start difference. First operand 184 states and 245 transitions. Second operand has 22 states, 20 states have (on average 3.35) internal successors, (67), 22 states have internal predecessors, (67), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-20 09:10:59,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:10:59,866 INFO L93 Difference]: Finished difference Result 413 states and 548 transitions. [2024-11-20 09:10:59,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 09:10:59,867 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.35) internal successors, (67), 22 states have internal predecessors, (67), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 124 [2024-11-20 09:10:59,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:10:59,868 INFO L225 Difference]: With dead ends: 413 [2024-11-20 09:10:59,868 INFO L226 Difference]: Without dead ends: 232 [2024-11-20 09:10:59,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=202, Invalid=854, Unknown=0, NotChecked=0, Total=1056 [2024-11-20 09:10:59,869 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 522 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 09:10:59,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1106 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 09:10:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-20 09:10:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 174. [2024-11-20 09:10:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 160 states have (on average 1.3) internal successors, (208), 160 states have internal predecessors, (208), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:10:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 232 transitions. [2024-11-20 09:10:59,884 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 232 transitions. Word has length 124 [2024-11-20 09:10:59,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:10:59,884 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 232 transitions. [2024-11-20 09:10:59,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.35) internal successors, (67), 22 states have internal predecessors, (67), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-20 09:10:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 232 transitions. [2024-11-20 09:10:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 09:10:59,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:10:59,885 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:10:59,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 09:10:59,886 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:10:59,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:10:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash 589855564, now seen corresponding path program 1 times [2024-11-20 09:10:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:10:59,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851580478] [2024-11-20 09:10:59,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:10:59,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:10:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:02,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:02,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:02,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:02,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:02,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:11:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:02,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:02,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:11:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:02,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:11:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:02,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:02,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:11:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:02,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:11:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:02,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:02,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:02,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851580478] [2024-11-20 09:11:02,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851580478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:02,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:02,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-20 09:11:02,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318055242] [2024-11-20 09:11:02,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:02,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-20 09:11:02,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:02,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-20 09:11:02,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-11-20 09:11:02,585 INFO L87 Difference]: Start difference. First operand 174 states and 232 transitions. Second operand has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 20 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-20 09:11:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:03,976 INFO L93 Difference]: Finished difference Result 390 states and 518 transitions. [2024-11-20 09:11:03,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 09:11:03,977 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 20 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2024-11-20 09:11:03,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:03,978 INFO L225 Difference]: With dead ends: 390 [2024-11-20 09:11:03,978 INFO L226 Difference]: Without dead ends: 219 [2024-11-20 09:11:03,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2024-11-20 09:11:03,979 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 286 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:03,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1013 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 09:11:03,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-20 09:11:03,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 161. [2024-11-20 09:11:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 147 states have internal predecessors, (191), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:11:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 215 transitions. [2024-11-20 09:11:03,993 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 215 transitions. Word has length 124 [2024-11-20 09:11:03,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:03,993 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 215 transitions. [2024-11-20 09:11:03,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 20 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-20 09:11:03,994 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 215 transitions. [2024-11-20 09:11:03,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 09:11:03,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:03,994 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:03,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 09:11:03,995 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:03,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1729668551, now seen corresponding path program 1 times [2024-11-20 09:11:03,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:03,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976333430] [2024-11-20 09:11:03,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:03,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:04,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:04,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:04,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:04,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:04,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:11:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:04,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:04,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:11:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:04,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:11:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:04,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:04,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:11:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:04,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:11:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:04,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:04,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:04,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976333430] [2024-11-20 09:11:04,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976333430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:04,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:04,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:11:04,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604281110] [2024-11-20 09:11:04,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:04,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:11:04,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:04,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:11:04,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:11:04,111 INFO L87 Difference]: Start difference. First operand 161 states and 215 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:04,132 INFO L93 Difference]: Finished difference Result 319 states and 427 transitions. [2024-11-20 09:11:04,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:11:04,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-20 09:11:04,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:04,133 INFO L225 Difference]: With dead ends: 319 [2024-11-20 09:11:04,133 INFO L226 Difference]: Without dead ends: 161 [2024-11-20 09:11:04,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-20 09:11:04,134 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:04,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:11:04,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-20 09:11:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-20 09:11:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 147 states have internal predecessors, (190), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:11:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 214 transitions. [2024-11-20 09:11:04,144 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 214 transitions. Word has length 125 [2024-11-20 09:11:04,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:04,144 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 214 transitions. [2024-11-20 09:11:04,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:04,144 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 214 transitions. [2024-11-20 09:11:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 09:11:04,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:04,145 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:04,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 09:11:04,145 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:04,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:04,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1895486879, now seen corresponding path program 1 times [2024-11-20 09:11:04,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:04,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618958499] [2024-11-20 09:11:04,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:04,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:05,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:05,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:05,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:05,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:05,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:11:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:05,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:05,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:11:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:05,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:11:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:05,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:05,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:11:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:05,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:11:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:05,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:05,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:05,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618958499] [2024-11-20 09:11:05,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618958499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:05,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:05,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-20 09:11:05,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162158662] [2024-11-20 09:11:05,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:05,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 09:11:05,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:05,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 09:11:05,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-11-20 09:11:05,729 INFO L87 Difference]: Start difference. First operand 161 states and 214 transitions. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:07,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:07,401 INFO L93 Difference]: Finished difference Result 426 states and 558 transitions. [2024-11-20 09:11:07,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 09:11:07,401 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-20 09:11:07,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:07,402 INFO L225 Difference]: With dead ends: 426 [2024-11-20 09:11:07,405 INFO L226 Difference]: Without dead ends: 268 [2024-11-20 09:11:07,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2024-11-20 09:11:07,406 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 400 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:07,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1420 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 09:11:07,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-20 09:11:07,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 183. [2024-11-20 09:11:07,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 169 states have internal predecessors, (218), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:11:07,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 242 transitions. [2024-11-20 09:11:07,417 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 242 transitions. Word has length 125 [2024-11-20 09:11:07,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:07,418 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 242 transitions. [2024-11-20 09:11:07,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:07,418 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 242 transitions. [2024-11-20 09:11:07,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 09:11:07,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:07,418 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:07,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 09:11:07,419 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:07,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:07,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1193887005, now seen corresponding path program 1 times [2024-11-20 09:11:07,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:07,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674837424] [2024-11-20 09:11:07,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:07,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:07,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:07,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:07,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:07,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:07,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:11:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:07,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:07,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:11:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:07,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:11:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:07,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:07,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:11:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:07,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:11:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:07,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:07,754 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:07,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:07,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674837424] [2024-11-20 09:11:07,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674837424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:07,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:07,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 09:11:07,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857515395] [2024-11-20 09:11:07,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:07,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 09:11:07,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:07,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 09:11:07,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:11:07,757 INFO L87 Difference]: Start difference. First operand 183 states and 242 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:07,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:07,965 INFO L93 Difference]: Finished difference Result 415 states and 546 transitions. [2024-11-20 09:11:07,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:11:07,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-20 09:11:07,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:07,966 INFO L225 Difference]: With dead ends: 415 [2024-11-20 09:11:07,966 INFO L226 Difference]: Without dead ends: 235 [2024-11-20 09:11:07,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:11:07,967 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 156 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:07,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 580 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:11:07,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-20 09:11:07,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 164. [2024-11-20 09:11:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 150 states have (on average 1.2933333333333332) internal successors, (194), 150 states have internal predecessors, (194), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:11:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 218 transitions. [2024-11-20 09:11:07,977 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 218 transitions. Word has length 125 [2024-11-20 09:11:07,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:07,977 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 218 transitions. [2024-11-20 09:11:07,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 218 transitions. [2024-11-20 09:11:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 09:11:07,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:07,978 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:07,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 09:11:07,978 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:07,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:07,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2014807907, now seen corresponding path program 1 times [2024-11-20 09:11:07,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:07,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129462817] [2024-11-20 09:11:07,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:07,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:09,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:09,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:09,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:09,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:09,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:11:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:09,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:09,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:11:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:09,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:11:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:09,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:09,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:11:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:09,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:11:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:09,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-20 09:11:09,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:09,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129462817] [2024-11-20 09:11:09,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129462817] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:11:09,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983217554] [2024-11-20 09:11:09,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:09,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:11:09,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:11:09,521 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-20 09:11:09,522 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-20 09:11:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:09,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 09:11:09,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:11:10,452 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 11 treesize of output 7 [2024-11-20 09:11:10,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:11:10,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 09:11:10,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:11:10,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 09:11:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:10,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:11:10,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983217554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:10,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 09:11:10,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 24 [2024-11-20 09:11:10,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301511656] [2024-11-20 09:11:10,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:10,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 09:11:10,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:10,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 09:11:10,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2024-11-20 09:11:10,672 INFO L87 Difference]: Start difference. First operand 164 states and 218 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:11,035 INFO L93 Difference]: Finished difference Result 387 states and 511 transitions. [2024-11-20 09:11:11,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 09:11:11,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-20 09:11:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:11,036 INFO L225 Difference]: With dead ends: 387 [2024-11-20 09:11:11,036 INFO L226 Difference]: Without dead ends: 226 [2024-11-20 09:11:11,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2024-11-20 09:11:11,037 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 200 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:11,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 823 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 09:11:11,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-20 09:11:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 186. [2024-11-20 09:11:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 172 states have (on average 1.2965116279069768) internal successors, (223), 172 states have internal predecessors, (223), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:11:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 247 transitions. [2024-11-20 09:11:11,048 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 247 transitions. Word has length 125 [2024-11-20 09:11:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:11,048 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 247 transitions. [2024-11-20 09:11:11,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 247 transitions. [2024-11-20 09:11:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 09:11:11,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:11,049 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:11,058 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-20 09:11:11,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-20 09:11:11,250 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:11,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:11,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2037440161, now seen corresponding path program 1 times [2024-11-20 09:11:11,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:11,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917285273] [2024-11-20 09:11:11,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:11,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:13,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:13,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:13,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:13,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:13,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:11:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:13,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:13,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:11:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:13,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:11:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:13,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:13,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:11:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:13,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:11:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:13,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:13,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:13,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917285273] [2024-11-20 09:11:13,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917285273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:13,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:13,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-20 09:11:13,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724100767] [2024-11-20 09:11:13,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:13,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-20 09:11:13,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:13,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 09:11:13,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-11-20 09:11:13,205 INFO L87 Difference]: Start difference. First operand 186 states and 247 transitions. Second operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-20 09:11:14,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:14,741 INFO L93 Difference]: Finished difference Result 476 states and 623 transitions. [2024-11-20 09:11:14,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 09:11:14,741 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 125 [2024-11-20 09:11:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:14,742 INFO L225 Difference]: With dead ends: 476 [2024-11-20 09:11:14,742 INFO L226 Difference]: Without dead ends: 293 [2024-11-20 09:11:14,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2024-11-20 09:11:14,743 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 293 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:14,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1169 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 09:11:14,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-20 09:11:14,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 196. [2024-11-20 09:11:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 182 states have (on average 1.2967032967032968) internal successors, (236), 182 states have internal predecessors, (236), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:11:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 260 transitions. [2024-11-20 09:11:14,758 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 260 transitions. Word has length 125 [2024-11-20 09:11:14,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:14,758 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 260 transitions. [2024-11-20 09:11:14,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-20 09:11:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 260 transitions. [2024-11-20 09:11:14,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-20 09:11:14,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:14,759 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:14,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 09:11:14,759 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:14,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:14,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1610679730, now seen corresponding path program 1 times [2024-11-20 09:11:14,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:14,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116728216] [2024-11-20 09:11:14,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:14,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:16,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:16,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:16,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:16,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:16,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:11:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:16,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:16,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:11:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:16,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:11:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:16,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:16,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:11:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:16,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:11:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:16,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:16,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:16,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116728216] [2024-11-20 09:11:16,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116728216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:16,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:16,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 09:11:16,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647274042] [2024-11-20 09:11:16,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:16,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 09:11:16,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:16,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 09:11:16,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-20 09:11:16,876 INFO L87 Difference]: Start difference. First operand 196 states and 260 transitions. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 09:11:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:18,074 INFO L93 Difference]: Finished difference Result 575 states and 758 transitions. [2024-11-20 09:11:18,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 09:11:18,075 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 127 [2024-11-20 09:11:18,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:18,076 INFO L225 Difference]: With dead ends: 575 [2024-11-20 09:11:18,076 INFO L226 Difference]: Without dead ends: 382 [2024-11-20 09:11:18,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2024-11-20 09:11:18,077 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 267 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:18,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1156 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 09:11:18,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-20 09:11:18,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 323. [2024-11-20 09:11:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 296 states have (on average 1.2837837837837838) internal successors, (380), 296 states have internal predecessors, (380), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 09:11:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 428 transitions. [2024-11-20 09:11:18,102 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 428 transitions. Word has length 127 [2024-11-20 09:11:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:18,103 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 428 transitions. [2024-11-20 09:11:18,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 09:11:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 428 transitions. [2024-11-20 09:11:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-20 09:11:18,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:18,103 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:18,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 09:11:18,104 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:18,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash 227895803, now seen corresponding path program 1 times [2024-11-20 09:11:18,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:18,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069251835] [2024-11-20 09:11:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:18,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:19,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:19,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:19,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:19,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:19,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:11:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:19,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:19,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:11:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:19,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:11:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:19,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:19,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:11:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:19,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:11:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:19,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:19,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:19,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069251835] [2024-11-20 09:11:19,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069251835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:19,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:19,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 09:11:19,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145851221] [2024-11-20 09:11:19,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:19,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:11:19,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:19,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:11:19,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:11:19,207 INFO L87 Difference]: Start difference. First operand 323 states and 428 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:20,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:20,095 INFO L93 Difference]: Finished difference Result 609 states and 798 transitions. [2024-11-20 09:11:20,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 09:11:20,096 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-20 09:11:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:20,098 INFO L225 Difference]: With dead ends: 609 [2024-11-20 09:11:20,098 INFO L226 Difference]: Without dead ends: 416 [2024-11-20 09:11:20,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-20 09:11:20,099 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 277 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:20,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 919 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 09:11:20,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-20 09:11:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 305. [2024-11-20 09:11:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 278 states have (on average 1.2805755395683454) internal successors, (356), 278 states have internal predecessors, (356), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 09:11:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 404 transitions. [2024-11-20 09:11:20,144 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 404 transitions. Word has length 127 [2024-11-20 09:11:20,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:20,144 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 404 transitions. [2024-11-20 09:11:20,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 404 transitions. [2024-11-20 09:11:20,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 09:11:20,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:20,145 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:20,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 09:11:20,146 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:20,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:20,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1418567797, now seen corresponding path program 1 times [2024-11-20 09:11:20,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:20,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271414326] [2024-11-20 09:11:20,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:20,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:20,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:20,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:20,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:20,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:20,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:11:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:20,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:20,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:11:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:20,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:11:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:20,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:20,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:11:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:11:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:20,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:20,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271414326] [2024-11-20 09:11:20,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271414326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:20,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:20,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:11:20,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266389680] [2024-11-20 09:11:20,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:20,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:11:20,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:20,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:11:20,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:11:20,335 INFO L87 Difference]: Start difference. First operand 305 states and 404 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:20,510 INFO L93 Difference]: Finished difference Result 661 states and 874 transitions. [2024-11-20 09:11:20,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:11:20,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-20 09:11:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:20,512 INFO L225 Difference]: With dead ends: 661 [2024-11-20 09:11:20,513 INFO L226 Difference]: Without dead ends: 359 [2024-11-20 09:11:20,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:11:20,514 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 31 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:20,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 654 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 09:11:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-20 09:11:20,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 309. [2024-11-20 09:11:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 282 states have (on average 1.2765957446808511) internal successors, (360), 282 states have internal predecessors, (360), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 09:11:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 408 transitions. [2024-11-20 09:11:20,543 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 408 transitions. Word has length 128 [2024-11-20 09:11:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:20,543 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 408 transitions. [2024-11-20 09:11:20,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:20,543 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 408 transitions. [2024-11-20 09:11:20,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-20 09:11:20,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:20,544 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:20,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 09:11:20,544 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:20,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:20,545 INFO L85 PathProgramCache]: Analyzing trace with hash -941430267, now seen corresponding path program 1 times [2024-11-20 09:11:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:20,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503374231] [2024-11-20 09:11:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:11:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:11:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:11:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:11:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:11:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:21,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:21,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503374231] [2024-11-20 09:11:21,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503374231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:21,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:21,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 09:11:21,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417233901] [2024-11-20 09:11:21,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:21,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 09:11:21,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:21,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 09:11:21,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:11:21,149 INFO L87 Difference]: Start difference. First operand 309 states and 408 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:21,459 INFO L93 Difference]: Finished difference Result 375 states and 487 transitions. [2024-11-20 09:11:21,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:11:21,459 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-20 09:11:21,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:21,460 INFO L225 Difference]: With dead ends: 375 [2024-11-20 09:11:21,461 INFO L226 Difference]: Without dead ends: 373 [2024-11-20 09:11:21,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:11:21,461 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 292 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:21,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 618 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:11:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-20 09:11:21,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 359. [2024-11-20 09:11:21,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 332 states have (on average 1.2710843373493976) internal successors, (422), 332 states have internal predecessors, (422), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 09:11:21,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 470 transitions. [2024-11-20 09:11:21,486 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 470 transitions. Word has length 129 [2024-11-20 09:11:21,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:21,486 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 470 transitions. [2024-11-20 09:11:21,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:21,486 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 470 transitions. [2024-11-20 09:11:21,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-20 09:11:21,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:21,487 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:21,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 09:11:21,488 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:21,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:21,488 INFO L85 PathProgramCache]: Analyzing trace with hash -939583225, now seen corresponding path program 1 times [2024-11-20 09:11:21,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:21,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714012955] [2024-11-20 09:11:21,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:21,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:11:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:11:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:11:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:11:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:11:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:21,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:21,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714012955] [2024-11-20 09:11:21,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714012955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:21,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:21,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:11:21,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080870452] [2024-11-20 09:11:21,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:21,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:11:21,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:21,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:11:21,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:11:21,660 INFO L87 Difference]: Start difference. First operand 359 states and 470 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:21,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:21,867 INFO L93 Difference]: Finished difference Result 785 states and 1026 transitions. [2024-11-20 09:11:21,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:11:21,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-20 09:11:21,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:21,869 INFO L225 Difference]: With dead ends: 785 [2024-11-20 09:11:21,869 INFO L226 Difference]: Without dead ends: 429 [2024-11-20 09:11:21,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:11:21,870 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 23 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:21,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 478 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:11:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-20 09:11:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 386. [2024-11-20 09:11:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 359 states have (on average 1.275766016713092) internal successors, (458), 359 states have internal predecessors, (458), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 09:11:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 506 transitions. [2024-11-20 09:11:21,898 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 506 transitions. Word has length 129 [2024-11-20 09:11:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:21,898 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 506 transitions. [2024-11-20 09:11:21,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:21,898 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 506 transitions. [2024-11-20 09:11:21,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-20 09:11:21,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:21,899 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:21,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-20 09:11:21,899 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:21,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:21,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1332610235, now seen corresponding path program 1 times [2024-11-20 09:11:21,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:21,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231210864] [2024-11-20 09:11:21,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:21,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:22,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:22,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:22,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:22,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:22,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:11:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:22,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:11:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:22,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 09:11:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:22,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:11:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:22,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:11:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:22,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:11:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:22,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:11:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:22,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:11:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:22,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:22,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231210864] [2024-11-20 09:11:22,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231210864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:22,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:22,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 09:11:22,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635491259] [2024-11-20 09:11:22,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:22,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 09:11:22,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:22,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 09:11:22,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:11:22,732 INFO L87 Difference]: Start difference. First operand 386 states and 506 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 09:11:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:23,057 INFO L93 Difference]: Finished difference Result 783 states and 1023 transitions. [2024-11-20 09:11:23,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:11:23,057 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 129 [2024-11-20 09:11:23,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:23,059 INFO L225 Difference]: With dead ends: 783 [2024-11-20 09:11:23,059 INFO L226 Difference]: Without dead ends: 400 [2024-11-20 09:11:23,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-20 09:11:23,060 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 261 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:23,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 368 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:11:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-20 09:11:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 386. [2024-11-20 09:11:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 359 states have (on average 1.2701949860724233) internal successors, (456), 359 states have internal predecessors, (456), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 09:11:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 504 transitions. [2024-11-20 09:11:23,086 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 504 transitions. Word has length 129 [2024-11-20 09:11:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:23,087 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 504 transitions. [2024-11-20 09:11:23,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 09:11:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 504 transitions. [2024-11-20 09:11:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-20 09:11:23,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:23,088 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:23,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-20 09:11:23,088 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:23,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:23,088 INFO L85 PathProgramCache]: Analyzing trace with hash 442397127, now seen corresponding path program 1 times [2024-11-20 09:11:23,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:23,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883283869] [2024-11-20 09:11:23,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:23,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:11:23,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 09:11:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:11:23,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 09:11:23,309 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 09:11:23,310 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 09:11:23,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-20 09:11:23,314 INFO L407 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] [2024-11-20 09:11:23,416 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 09:11:23,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:11:23 BoogieIcfgContainer [2024-11-20 09:11:23,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 09:11:23,418 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 09:11:23,418 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 09:11:23,418 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 09:11:23,419 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:10:31" (3/4) ... [2024-11-20 09:11:23,421 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 09:11:23,422 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 09:11:23,422 INFO L158 Benchmark]: Toolchain (without parser) took 53073.14ms. Allocated memory was 144.7MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 74.6MB in the beginning and 699.3MB in the end (delta: -624.7MB). Peak memory consumption was 258.6MB. Max. memory is 16.1GB. [2024-11-20 09:11:23,422 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 144.7MB. Free memory was 107.8MB in the beginning and 107.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:11:23,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.15ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 74.4MB in the beginning and 166.7MB in the end (delta: -92.3MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-20 09:11:23,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.94ms. Allocated memory is still 207.6MB. Free memory was 166.7MB in the beginning and 162.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:11:23,424 INFO L158 Benchmark]: Boogie Preprocessor took 65.56ms. Allocated memory is still 207.6MB. Free memory was 162.7MB in the beginning and 158.3MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:11:23,424 INFO L158 Benchmark]: RCFGBuilder took 681.02ms. Allocated memory is still 207.6MB. Free memory was 158.3MB in the beginning and 119.6MB in the end (delta: 38.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-20 09:11:23,424 INFO L158 Benchmark]: TraceAbstraction took 51972.56ms. Allocated memory was 207.6MB in the beginning and 1.0GB in the end (delta: 817.9MB). Free memory was 118.6MB in the beginning and 700.4MB in the end (delta: -581.7MB). Peak memory consumption was 238.0MB. Max. memory is 16.1GB. [2024-11-20 09:11:23,424 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 1.0GB. Free memory was 700.4MB in the beginning and 699.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:11:23,425 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 144.7MB. Free memory was 107.8MB in the beginning and 107.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.15ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 74.4MB in the beginning and 166.7MB in the end (delta: -92.3MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.94ms. Allocated memory is still 207.6MB. Free memory was 166.7MB in the beginning and 162.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.56ms. Allocated memory is still 207.6MB. Free memory was 162.7MB in the beginning and 158.3MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 681.02ms. Allocated memory is still 207.6MB. Free memory was 158.3MB in the beginning and 119.6MB in the end (delta: 38.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 51972.56ms. Allocated memory was 207.6MB in the beginning and 1.0GB in the end (delta: 817.9MB). Free memory was 118.6MB in the beginning and 700.4MB in the end (delta: -581.7MB). Peak memory consumption was 238.0MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 1.0GB. Free memory was 700.4MB in the beginning and 699.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryArithmeticDOUBLEoperation at line 90. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L55] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] unsigned short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L58] signed char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L59] signed long int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L60] double* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L61] double* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L62] double* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L63] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L64] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L65] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L66] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L67] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L68] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=0] [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] FCALL updateLastVariables() [L126] CALL updateVariables() [L94] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L97] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L100] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_9 [L101] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_9 [L101] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L101] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L102] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L103] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L104] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L105] EXPR WrapperStruct00.var_1_11 [L105] EXPR WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_11 [L105] EXPR WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L105] EXPR (WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L106] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L107] EXPR WrapperStruct00.var_1_12 [L107] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_12 [L107] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L107] 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:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L107] 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:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L107] 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:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L108] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L111] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L112] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L126] RET updateVariables() [L127] CALL step() [L72] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L72] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L73] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L73] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L74] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L74] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L77] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L77] (*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L77] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) [L80] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L80] unsigned short int stepLocal_0 = (*(WrapperStruct00_var_1_4_Pointer)); [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, stepLocal_0=-49153] [L81] EXPR (*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, stepLocal_0=-49153] [L81] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)))) [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, stepLocal_0=-49153] [L81] EXPR (*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, stepLocal_0=-49153] [L81] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, stepLocal_0=-49153] [L81] COND FALSE !(stepLocal_0 <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) [L84] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L84] (*(WrapperStruct00_var_1_7_Pointer)) = ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))) [L86] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L86] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_13_Pointer)); [L87] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, stepLocal_1=512] [L87] COND FALSE !((*(WrapperStruct00_var_1_13_Pointer)) < stepLocal_1) [L90] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L90] (*(WrapperStruct00_var_1_8_Pointer)) = (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1) [L118] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L118] EXPR (*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer))))))) [L118] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)))) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))) [L118] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L118] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer)))))) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) [L118] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L118] EXPR ((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118-L119] return ((((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.8s, OverallIterations: 29, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5028 SdHoareTripleChecker+Valid, 11.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5020 mSDsluCounter, 19885 SdHoareTripleChecker+Invalid, 10.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15904 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12408 IncrementalHoareTripleChecker+Invalid, 12628 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 3981 mSDtfsCounter, 12408 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1245 GetRequests, 884 SyntacticMatches, 3 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1697 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred in iteration=27, InterpolantAutomatonStates: 246, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 1067 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 3701 NumberOfCodeBlocks, 3701 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3543 ConstructedInterpolants, 0 QuantifiedInterpolants, 49592 SizeOfPredicates, 10 NumberOfNonLiveVariables, 548 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 29 InterpolantComputations, 28 PerfectInterpolantSequences, 7632/7656 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-20 09:11:23,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.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 d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:11:25,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:11:25,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 09:11:25,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:11:25,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:11:25,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:11:25,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:11:25,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:11:25,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:11:25,345 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:11:25,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:11:25,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:11:25,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:11:25,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:11:25,346 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:11:25,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:11:25,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:11:25,349 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:11:25,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:11:25,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:11:25,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:11:25,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:11:25,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:11:25,353 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 09:11:25,353 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 09:11:25,353 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:11:25,353 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 09:11:25,353 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:11:25,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:11:25,354 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:11:25,354 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:11:25,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:11:25,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:11:25,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:11:25,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:11:25,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:11:25,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:11:25,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:11:25,361 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 09:11:25,362 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 09:11:25,362 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:11:25,362 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:11:25,362 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:11:25,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:11:25,362 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 -> d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 [2024-11-20 09:11:25,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:11:25,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:11:25,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:11:25,639 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:11:25,639 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:11:25,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2024-11-20 09:11:26,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:11:27,041 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:11:27,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2024-11-20 09:11:27,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf31b451d/77c3c2b9a10c49b09b260a7ad5e605d4/FLAG13e3e9afd [2024-11-20 09:11:27,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf31b451d/77c3c2b9a10c49b09b260a7ad5e605d4 [2024-11-20 09:11:27,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:11:27,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:11:27,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:11:27,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:11:27,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:11:27,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:11:27" (1/1) ... [2024-11-20 09:11:27,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a577cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:27, skipping insertion in model container [2024-11-20 09:11:27,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:11:27" (1/1) ... [2024-11-20 09:11:27,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:11:27,628 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-70.i[917,930] [2024-11-20 09:11:27,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:11:27,702 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:11:27,713 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-70.i[917,930] [2024-11-20 09:11:27,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:11:27,784 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:11:27,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:27 WrapperNode [2024-11-20 09:11:27,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:11:27,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:11:27,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:11:27,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:11:27,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:27" (1/1) ... [2024-11-20 09:11:27,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:27" (1/1) ... [2024-11-20 09:11:27,851 INFO L138 Inliner]: procedures = 37, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2024-11-20 09:11:27,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:11:27,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:11:27,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:11:27,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:11:27,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:27" (1/1) ... [2024-11-20 09:11:27,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:27" (1/1) ... [2024-11-20 09:11:27,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:27" (1/1) ... [2024-11-20 09:11:27,903 INFO L175 MemorySlicer]: Split 133 memory accesses to 2 slices as follows [2, 131]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2024-11-20 09:11:27,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:27" (1/1) ... [2024-11-20 09:11:27,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:27" (1/1) ... [2024-11-20 09:11:27,926 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:27" (1/1) ... [2024-11-20 09:11:27,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:27" (1/1) ... [2024-11-20 09:11:27,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:27" (1/1) ... [2024-11-20 09:11:27,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:27" (1/1) ... [2024-11-20 09:11:27,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:11:27,961 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:11:27,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:11:27,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:11:27,962 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:27" (1/1) ... [2024-11-20 09:11:27,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:11:27,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:11:27,993 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-20 09:11:28,000 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-20 09:11:28,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:11:28,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-20 09:11:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-20 09:11:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-20 09:11:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-20 09:11:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-20 09:11:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-20 09:11:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 09:11:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 09:11:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 09:11:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 09:11:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 09:11:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 09:11:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-20 09:11:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-20 09:11:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-20 09:11:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-20 09:11:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-20 09:11:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-20 09:11:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-20 09:11:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-20 09:11:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:11:28,047 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:11:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:11:28,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:11:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 09:11:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 09:11:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-20 09:11:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-20 09:11:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 09:11:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 09:11:28,184 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:11:28,186 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:11:32,191 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2024-11-20 09:11:32,191 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:11:32,202 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:11:32,202 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:11:32,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:11:32 BoogieIcfgContainer [2024-11-20 09:11:32,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:11:32,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:11:32,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:11:32,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:11:32,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:11:27" (1/3) ... [2024-11-20 09:11:32,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f3b504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:11:32, skipping insertion in model container [2024-11-20 09:11:32,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:27" (2/3) ... [2024-11-20 09:11:32,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f3b504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:11:32, skipping insertion in model container [2024-11-20 09:11:32,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:11:32" (3/3) ... [2024-11-20 09:11:32,211 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-70.i [2024-11-20 09:11:32,223 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:11:32,223 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:11:32,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:11:32,296 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;@37568759, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:11:32,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:11:32,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:11:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 09:11:32,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:32,308 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:32,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:32,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:32,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1213743039, now seen corresponding path program 1 times [2024-11-20 09:11:32,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:11:32,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746655995] [2024-11-20 09:11:32,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:32,325 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-20 09:11:32,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:11:32,328 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-20 09:11:32,329 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-20 09:11:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:32,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 09:11:32,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:11:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-20 09:11:32,720 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:11:32,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:11:32,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746655995] [2024-11-20 09:11:32,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746655995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:32,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:32,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:11:32,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575793368] [2024-11-20 09:11:32,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:32,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:11:32,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:11:32,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:11:32,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:11:32,746 INFO L87 Difference]: Start difference. First operand has 101 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 09:11:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:32,768 INFO L93 Difference]: Finished difference Result 195 states and 302 transitions. [2024-11-20 09:11:32,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:11:32,771 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-20 09:11:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:32,777 INFO L225 Difference]: With dead ends: 195 [2024-11-20 09:11:32,777 INFO L226 Difference]: Without dead ends: 97 [2024-11-20 09:11:32,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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-20 09:11:32,784 INFO L432 NwaCegarLoop]: 141 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, 141 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-20 09:11:32,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:11:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-20 09:11:32,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-20 09:11:32,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 83 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:11:32,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2024-11-20 09:11:32,819 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 115 [2024-11-20 09:11:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:32,819 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2024-11-20 09:11:32,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 09:11:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2024-11-20 09:11:32,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 09:11:32,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:32,822 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:32,832 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-20 09:11:33,022 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-20 09:11:33,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:33,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:33,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1354941361, now seen corresponding path program 1 times [2024-11-20 09:11:33,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:11:33,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654315659] [2024-11-20 09:11:33,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:33,024 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-20 09:11:33,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:11:33,027 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-20 09:11:33,027 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-20 09:11:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:33,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 09:11:33,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:11:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-20 09:11:33,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:11:33,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:11:33,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654315659] [2024-11-20 09:11:33,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654315659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:33,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:33,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:11:33,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277665623] [2024-11-20 09:11:33,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:33,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:11:33,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:11:33,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:11:33,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:11:33,376 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 09:11:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:33,459 INFO L93 Difference]: Finished difference Result 193 states and 282 transitions. [2024-11-20 09:11:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:11:33,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-20 09:11:33,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:33,462 INFO L225 Difference]: With dead ends: 193 [2024-11-20 09:11:33,462 INFO L226 Difference]: Without dead ends: 99 [2024-11-20 09:11:33,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 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-20 09:11:33,464 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:33,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 09:11:33,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-20 09:11:33,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-20 09:11:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.4) internal successors, (119), 85 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:11:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 143 transitions. [2024-11-20 09:11:33,484 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 143 transitions. Word has length 115 [2024-11-20 09:11:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:33,485 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 143 transitions. [2024-11-20 09:11:33,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 09:11:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 143 transitions. [2024-11-20 09:11:33,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 09:11:33,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:33,489 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:33,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 09:11:33,689 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-20 09:11:33,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:33,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:33,690 INFO L85 PathProgramCache]: Analyzing trace with hash 401001203, now seen corresponding path program 1 times [2024-11-20 09:11:33,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:11:33,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721184903] [2024-11-20 09:11:33,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:33,691 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-20 09:11:33,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:11:33,694 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-20 09:11:33,694 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-20 09:11:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:33,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 09:11:34,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:11:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:34,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:11:34,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:11:34,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721184903] [2024-11-20 09:11:34,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721184903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:34,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:34,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:11:34,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166199008] [2024-11-20 09:11:34,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:34,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:11:34,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:11:34,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:11:34,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:11:34,098 INFO L87 Difference]: Start difference. First operand 99 states and 143 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:35,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 09:11:38,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:38,114 INFO L93 Difference]: Finished difference Result 206 states and 300 transitions. [2024-11-20 09:11:38,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:11:38,116 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-20 09:11:38,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:38,118 INFO L225 Difference]: With dead ends: 206 [2024-11-20 09:11:38,118 INFO L226 Difference]: Without dead ends: 110 [2024-11-20 09:11:38,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:11:38,119 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 13 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:38,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 402 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-20 09:11:38,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-20 09:11:38,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2024-11-20 09:11:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:11:38,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2024-11-20 09:11:38,127 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 115 [2024-11-20 09:11:38,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:38,128 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2024-11-20 09:11:38,128 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:38,128 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2024-11-20 09:11:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 09:11:38,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:38,129 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:38,140 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-20 09:11:38,331 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-20 09:11:38,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:38,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:38,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1185582413, now seen corresponding path program 1 times [2024-11-20 09:11:38,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:11:38,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138223615] [2024-11-20 09:11:38,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:38,333 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-20 09:11:38,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:11:38,336 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-20 09:11:38,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 09:11:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:38,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 09:11:38,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:11:38,634 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 17 treesize of output 9 [2024-11-20 09:11:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:38,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:11:38,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:11:38,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138223615] [2024-11-20 09:11:38,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138223615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:38,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:38,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:11:38,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144499839] [2024-11-20 09:11:38,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:38,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:11:38,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:11:38,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:11:38,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:11:38,659 INFO L87 Difference]: Start difference. First operand 102 states and 146 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:39,623 INFO L93 Difference]: Finished difference Result 201 states and 289 transitions. [2024-11-20 09:11:39,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:11:39,623 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-20 09:11:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:39,624 INFO L225 Difference]: With dead ends: 201 [2024-11-20 09:11:39,625 INFO L226 Difference]: Without dead ends: 102 [2024-11-20 09:11:39,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 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-20 09:11:39,626 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:39,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 09:11:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-20 09:11:39,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-20 09:11:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:11:39,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2024-11-20 09:11:39,638 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 115 [2024-11-20 09:11:39,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:39,639 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2024-11-20 09:11:39,639 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:39,639 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2024-11-20 09:11:39,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 09:11:39,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:39,640 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:39,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-20 09:11:39,841 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-20 09:11:39,841 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:39,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:39,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1521036981, now seen corresponding path program 1 times [2024-11-20 09:11:39,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:11:39,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413043755] [2024-11-20 09:11:39,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:39,843 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-20 09:11:39,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:11:39,845 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-20 09:11:39,846 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-20 09:11:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:40,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 09:11:40,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:11:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:40,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:11:40,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:11:40,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413043755] [2024-11-20 09:11:40,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413043755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:40,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:40,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:11:40,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441392027] [2024-11-20 09:11:40,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:40,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:11:40,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:11:40,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:11:40,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:11:40,216 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:40,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:40,242 INFO L93 Difference]: Finished difference Result 203 states and 290 transitions. [2024-11-20 09:11:40,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:11:40,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-20 09:11:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:40,244 INFO L225 Difference]: With dead ends: 203 [2024-11-20 09:11:40,244 INFO L226 Difference]: Without dead ends: 104 [2024-11-20 09:11:40,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 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-20 09:11:40,245 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 403 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-20 09:11:40,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 403 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:11:40,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-20 09:11:40,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-20 09:11:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:11:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2024-11-20 09:11:40,251 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 115 [2024-11-20 09:11:40,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:40,251 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2024-11-20 09:11:40,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2024-11-20 09:11:40,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 09:11:40,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:40,253 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:40,266 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-20 09:11:40,474 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-20 09:11:40,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:40,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:40,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1631251536, now seen corresponding path program 1 times [2024-11-20 09:11:40,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:11:40,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537278360] [2024-11-20 09:11:40,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:40,476 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-20 09:11:40,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:11:40,478 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-20 09:11:40,486 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-20 09:11:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:40,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 09:11:40,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:11:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:40,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:11:40,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:11:40,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537278360] [2024-11-20 09:11:40,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537278360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:40,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:40,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:11:40,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612731022] [2024-11-20 09:11:40,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:40,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:11:40,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:11:40,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:11:40,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:11:40,856 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:40,913 INFO L93 Difference]: Finished difference Result 212 states and 301 transitions. [2024-11-20 09:11:40,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:11:40,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-20 09:11:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:40,914 INFO L225 Difference]: With dead ends: 212 [2024-11-20 09:11:40,914 INFO L226 Difference]: Without dead ends: 111 [2024-11-20 09:11:40,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 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-20 09:11:40,915 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 644 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.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:40,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 644 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:11:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-20 09:11:40,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-20 09:11:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.34375) internal successors, (129), 96 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:11:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2024-11-20 09:11:40,928 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 153 transitions. Word has length 117 [2024-11-20 09:11:40,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:40,928 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 153 transitions. [2024-11-20 09:11:40,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 153 transitions. [2024-11-20 09:11:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 09:11:40,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:40,930 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:40,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 09:11:41,130 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-20 09:11:41,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:41,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:41,131 INFO L85 PathProgramCache]: Analyzing trace with hash -888708398, now seen corresponding path program 1 times [2024-11-20 09:11:41,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:11:41,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280841566] [2024-11-20 09:11:41,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:41,132 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-20 09:11:41,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:11:41,133 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-20 09:11:41,134 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-20 09:11:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:41,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 09:11:41,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:11:41,525 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 09:11:41,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:11:41,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:11:41,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280841566] [2024-11-20 09:11:41,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280841566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:41,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:41,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:11:41,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567619486] [2024-11-20 09:11:41,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:41,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:11:41,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:11:41,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:11:41,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:11:41,528 INFO L87 Difference]: Start difference. First operand 110 states and 153 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:41,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:41,598 INFO L93 Difference]: Finished difference Result 220 states and 307 transitions. [2024-11-20 09:11:41,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:11:41,598 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-20 09:11:41,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:41,599 INFO L225 Difference]: With dead ends: 220 [2024-11-20 09:11:41,600 INFO L226 Difference]: Without dead ends: 113 [2024-11-20 09:11:41,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 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-20 09:11:41,601 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 766 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-20 09:11:41,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 766 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 09:11:41,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-20 09:11:41,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-20 09:11:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.336734693877551) internal successors, (131), 98 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:11:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 155 transitions. [2024-11-20 09:11:41,606 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 155 transitions. Word has length 117 [2024-11-20 09:11:41,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:41,606 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 155 transitions. [2024-11-20 09:11:41,606 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 09:11:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 155 transitions. [2024-11-20 09:11:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 09:11:41,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:41,607 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:41,620 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-20 09:11:41,808 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-20 09:11:41,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:41,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:41,809 INFO L85 PathProgramCache]: Analyzing trace with hash -886861356, now seen corresponding path program 1 times [2024-11-20 09:11:41,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:11:41,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567592395] [2024-11-20 09:11:41,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:41,809 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-20 09:11:41,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:11:41,810 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-20 09:11:41,811 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-20 09:11:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:42,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 09:11:42,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:11:42,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:11:42,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-20 09:11:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-20 09:11:42,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:11:42,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:11:42,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567592395] [2024-11-20 09:11:42,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567592395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:42,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:42,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:11:42,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228463552] [2024-11-20 09:11:42,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:42,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:11:42,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:11:42,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:11:42,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:11:42,297 INFO L87 Difference]: Start difference. First operand 112 states and 155 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 09:11:43,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 09:11:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:46,358 INFO L93 Difference]: Finished difference Result 222 states and 308 transitions. [2024-11-20 09:11:46,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:11:46,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-11-20 09:11:46,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:46,359 INFO L225 Difference]: With dead ends: 222 [2024-11-20 09:11:46,359 INFO L226 Difference]: Without dead ends: 113 [2024-11-20 09:11:46,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 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-20 09:11:46,360 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 119 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:46,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 401 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-20 09:11:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-20 09:11:46,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-20 09:11:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 98 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 09:11:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 154 transitions. [2024-11-20 09:11:46,369 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 154 transitions. Word has length 117 [2024-11-20 09:11:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:46,369 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 154 transitions. [2024-11-20 09:11:46,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 09:11:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 154 transitions. [2024-11-20 09:11:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 09:11:46,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:46,370 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]