./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4adac79d6cea52ff1f2363c41bfef3a91ebf33bfb8642b8f2d3700c04ed5429 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:14:25,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:14:25,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:14:25,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:14:25,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:14:25,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:14:25,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:14:25,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:14:25,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:14:25,593 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:14:25,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:14:25,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:14:25,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:14:25,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:14:25,598 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:14:25,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:14:25,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:14:25,600 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:14:25,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:14:25,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:14:25,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:14:25,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:14:25,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:14:25,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:14:25,606 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:14:25,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:14:25,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:14:25,607 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:14:25,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:14:25,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:14:25,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:14:25,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:14:25,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:14:25,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:14:25,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:14:25,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:14:25,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:14:25,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:14:25,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:14:25,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:14:25,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:14:25,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:14:25,612 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 -> a4adac79d6cea52ff1f2363c41bfef3a91ebf33bfb8642b8f2d3700c04ed5429 [2024-11-09 02:14:25,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:14:25,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:14:25,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:14:25,918 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:14:25,918 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:14:25,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i [2024-11-09 02:14:27,413 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:14:27,611 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:14:27,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i [2024-11-09 02:14:27,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d223ab02/07123376fec74bb3b6b252fb2ae30698/FLAG4c9c6fb35 [2024-11-09 02:14:27,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d223ab02/07123376fec74bb3b6b252fb2ae30698 [2024-11-09 02:14:27,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:14:27,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:14:27,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:14:27,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:14:27,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:14:27,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:14:27" (1/1) ... [2024-11-09 02:14:27,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b7d4b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:27, skipping insertion in model container [2024-11-09 02:14:27,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:14:27" (1/1) ... [2024-11-09 02:14:27,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:14:27,868 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-54.i[917,930] [2024-11-09 02:14:27,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:14:27,985 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:14:27,999 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-54.i[917,930] [2024-11-09 02:14:28,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:14:28,065 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:14:28,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:28 WrapperNode [2024-11-09 02:14:28,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:14:28,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:14:28,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:14:28,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:14:28,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:28" (1/1) ... [2024-11-09 02:14:28,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:28" (1/1) ... [2024-11-09 02:14:28,134 INFO L138 Inliner]: procedures = 30, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2024-11-09 02:14:28,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:14:28,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:14:28,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:14:28,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:14:28,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:28" (1/1) ... [2024-11-09 02:14:28,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:28" (1/1) ... [2024-11-09 02:14:28,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:28" (1/1) ... [2024-11-09 02:14:28,174 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:14:28,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:28" (1/1) ... [2024-11-09 02:14:28,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:28" (1/1) ... [2024-11-09 02:14:28,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:28" (1/1) ... [2024-11-09 02:14:28,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:28" (1/1) ... [2024-11-09 02:14:28,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:28" (1/1) ... [2024-11-09 02:14:28,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:28" (1/1) ... [2024-11-09 02:14:28,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:14:28,208 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:14:28,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:14:28,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:14:28,209 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:28" (1/1) ... [2024-11-09 02:14:28,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:14:28,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:14:28,263 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-09 02:14:28,271 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-09 02:14:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:14:28,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:14:28,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:14:28,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:14:28,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:14:28,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:14:28,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:14:28,323 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:14:28,323 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:14:28,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:14:28,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:14:28,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:14:28,478 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:14:28,480 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:14:29,096 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-09 02:14:29,096 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:14:29,115 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:14:29,116 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:14:29,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:14:29 BoogieIcfgContainer [2024-11-09 02:14:29,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:14:29,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:14:29,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:14:29,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:14:29,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:14:27" (1/3) ... [2024-11-09 02:14:29,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4c3f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:14:29, skipping insertion in model container [2024-11-09 02:14:29,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:28" (2/3) ... [2024-11-09 02:14:29,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4c3f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:14:29, skipping insertion in model container [2024-11-09 02:14:29,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:14:29" (3/3) ... [2024-11-09 02:14:29,128 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-54.i [2024-11-09 02:14:29,145 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:14:29,146 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:14:29,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:14:29,236 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;@6fdb20f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:14:29,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:14:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:14:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 02:14:29,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:29,257 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:29,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:29,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:29,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1606318882, now seen corresponding path program 1 times [2024-11-09 02:14:29,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:29,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006063274] [2024-11-09 02:14:29,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:29,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:29,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:14:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:29,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:14:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:29,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:14:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:29,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:14:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:14:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:29,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:14:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:29,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:14:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:29,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:14:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:29,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:14:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:29,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:14:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:29,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:14:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:14:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:29,823 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-09 02:14:29,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:14:29,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006063274] [2024-11-09 02:14:29,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006063274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:29,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:29,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:14:29,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406717251] [2024-11-09 02:14:29,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:29,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:14:29,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:14:29,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:14:29,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:14:29,865 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:14:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:29,896 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-11-09 02:14:29,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:14:29,900 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-09 02:14:29,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:29,908 INFO L225 Difference]: With dead ends: 213 [2024-11-09 02:14:29,908 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 02:14:29,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-09 02:14:29,916 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:29,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:14:29,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 02:14:29,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 02:14:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:14:29,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-09 02:14:29,981 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2024-11-09 02:14:29,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:29,981 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-09 02:14:29,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:14:29,982 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-09 02:14:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 02:14:29,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:29,987 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:29,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:14:29,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:29,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:29,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1914200370, now seen corresponding path program 1 times [2024-11-09 02:14:29,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:29,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471639517] [2024-11-09 02:14:29,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:29,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:14:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:14:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:14:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:14:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:14:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:14:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:14:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:14:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:14:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:14:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:14:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:14:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,458 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-09 02:14:30,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:14:30,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471639517] [2024-11-09 02:14:30,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471639517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:30,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:30,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:14:30,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887194780] [2024-11-09 02:14:30,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:30,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:14:30,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:14:30,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:14:30,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:14:30,467 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:30,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:30,530 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-09 02:14:30,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:14:30,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-09 02:14:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:30,536 INFO L225 Difference]: With dead ends: 211 [2024-11-09 02:14:30,537 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 02:14:30,538 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-09 02:14:30,540 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-09 02:14:30,541 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-09 02:14:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 02:14:30,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 02:14:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:14:30,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-09 02:14:30,556 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2024-11-09 02:14:30,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:30,559 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-09 02:14:30,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-09 02:14:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 02:14:30,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:30,562 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:30,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:14:30,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:30,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash -314773303, now seen corresponding path program 1 times [2024-11-09 02:14:30,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:30,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061223711] [2024-11-09 02:14:30,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:30,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:14:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:14:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:14:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:14:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:14:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:14:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:14:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:14:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:14:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:14:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:14:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:14:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:14:30,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:14:30,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061223711] [2024-11-09 02:14:30,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061223711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:30,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:30,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:14:30,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047111715] [2024-11-09 02:14:30,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:30,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:14:30,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:14:30,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:14:30,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:14:30,824 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:30,885 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2024-11-09 02:14:30,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:14:30,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-09 02:14:30,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:30,890 INFO L225 Difference]: With dead ends: 216 [2024-11-09 02:14:30,890 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 02:14:30,890 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-09 02:14:30,894 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-09 02:14:30,895 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-09 02:14:30,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 02:14:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-09 02:14:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:14:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-09 02:14:30,916 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 107 [2024-11-09 02:14:30,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:30,917 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-09 02:14:30,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:30,917 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-09 02:14:30,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 02:14:30,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:30,923 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:30,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:14:30,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:30,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:30,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1460234059, now seen corresponding path program 1 times [2024-11-09 02:14:30,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:30,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474929527] [2024-11-09 02:14:30,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:30,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:14:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:14:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:14:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:14:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:14:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:14:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:14:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:14:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:14:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:14:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:14:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:14:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,140 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-09 02:14:31,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:14:31,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474929527] [2024-11-09 02:14:31,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474929527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:31,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:31,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:14:31,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947359574] [2024-11-09 02:14:31,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:31,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:14:31,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:14:31,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:14:31,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:14:31,144 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:31,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:31,170 INFO L93 Difference]: Finished difference Result 220 states and 319 transitions. [2024-11-09 02:14:31,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:14:31,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-09 02:14:31,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:31,177 INFO L225 Difference]: With dead ends: 220 [2024-11-09 02:14:31,177 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 02:14:31,178 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-09 02:14:31,179 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-09 02:14:31,179 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-09 02:14:31,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 02:14:31,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-09 02:14:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:14:31,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-09 02:14:31,188 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 107 [2024-11-09 02:14:31,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:31,189 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-09 02:14:31,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:31,189 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-09 02:14:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 02:14:31,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:31,191 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:31,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:14:31,192 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:31,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1462081101, now seen corresponding path program 1 times [2024-11-09 02:14:31,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:31,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927823209] [2024-11-09 02:14:31,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:31,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:14:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:14:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:14:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:14:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:14:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:14:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:14:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:14:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:14:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:14:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:14:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:14:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:31,799 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-09 02:14:31,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:14:31,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927823209] [2024-11-09 02:14:31,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927823209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:31,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:31,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:14:31,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457655929] [2024-11-09 02:14:31,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:31,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:14:31,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:14:31,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:14:31,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:14:31,803 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (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-09 02:14:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:32,116 INFO L93 Difference]: Finished difference Result 284 states and 410 transitions. [2024-11-09 02:14:32,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:14:32,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-09 02:14:32,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:32,118 INFO L225 Difference]: With dead ends: 284 [2024-11-09 02:14:32,118 INFO L226 Difference]: Without dead ends: 175 [2024-11-09 02:14:32,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:14:32,120 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 349 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:32,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 408 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:14:32,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-09 02:14:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 127. [2024-11-09 02:14:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.424778761061947) internal successors, (161), 113 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-09 02:14:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2024-11-09 02:14:32,133 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 107 [2024-11-09 02:14:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:32,134 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2024-11-09 02:14:32,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (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-09 02:14:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2024-11-09 02:14:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 02:14:32,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:32,136 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:32,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:14:32,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:32,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:32,136 INFO L85 PathProgramCache]: Analyzing trace with hash 544621908, now seen corresponding path program 1 times [2024-11-09 02:14:32,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:32,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484141410] [2024-11-09 02:14:32,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:32,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:33,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:14:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:33,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:14:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:33,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:14:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:33,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:14:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:33,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:14:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:33,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:14:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:33,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:14:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:33,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:14:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:33,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:14:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:33,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:14:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:33,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:14:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:33,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:14:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:33,913 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-09 02:14:33,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:14:33,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484141410] [2024-11-09 02:14:33,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484141410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:33,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:33,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:14:33,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902725858] [2024-11-09 02:14:33,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:33,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:14:33,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:14:33,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:14:33,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:14:33,918 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-09 02:14:34,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:34,205 INFO L93 Difference]: Finished difference Result 314 states and 461 transitions. [2024-11-09 02:14:34,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:14:34,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 108 [2024-11-09 02:14:34,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:34,208 INFO L225 Difference]: With dead ends: 314 [2024-11-09 02:14:34,208 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 02:14:34,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:14:34,209 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 100 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:34,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 539 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:14:34,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 02:14:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 175. [2024-11-09 02:14:34,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 148 states have (on average 1.3918918918918919) internal successors, (206), 148 states have internal predecessors, (206), 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-09 02:14:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 254 transitions. [2024-11-09 02:14:34,241 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 254 transitions. Word has length 108 [2024-11-09 02:14:34,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:34,242 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 254 transitions. [2024-11-09 02:14:34,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-09 02:14:34,242 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 254 transitions. [2024-11-09 02:14:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 02:14:34,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:34,243 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:34,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:14:34,243 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:34,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:34,244 INFO L85 PathProgramCache]: Analyzing trace with hash -273026542, now seen corresponding path program 1 times [2024-11-09 02:14:34,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:34,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883408725] [2024-11-09 02:14:34,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:34,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:35,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:14:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:35,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:14:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:35,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:14:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:35,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:14:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:35,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:14:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:35,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:14:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:35,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:14:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:35,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:14:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:35,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:14:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:35,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:14:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:35,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:14:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:35,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:14:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:35,980 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-09 02:14:35,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:14:35,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883408725] [2024-11-09 02:14:35,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883408725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:35,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:35,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 02:14:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654599824] [2024-11-09 02:14:35,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:35,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:14:35,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:14:35,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:14:35,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:14:35,983 INFO L87 Difference]: Start difference. First operand 175 states and 254 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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-09 02:14:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:36,424 INFO L93 Difference]: Finished difference Result 404 states and 587 transitions. [2024-11-09 02:14:36,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:14:36,425 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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 108 [2024-11-09 02:14:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:36,427 INFO L225 Difference]: With dead ends: 404 [2024-11-09 02:14:36,427 INFO L226 Difference]: Without dead ends: 280 [2024-11-09 02:14:36,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:14:36,428 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 291 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:36,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 485 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:14:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-09 02:14:36,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 222. [2024-11-09 02:14:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 195 states have (on average 1.4) internal successors, (273), 195 states have internal predecessors, (273), 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-09 02:14:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 321 transitions. [2024-11-09 02:14:36,458 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 321 transitions. Word has length 108 [2024-11-09 02:14:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:36,459 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 321 transitions. [2024-11-09 02:14:36,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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-09 02:14:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 321 transitions. [2024-11-09 02:14:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 02:14:36,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:36,460 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:36,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:14:36,461 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash -859832556, now seen corresponding path program 1 times [2024-11-09 02:14:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:36,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527711702] [2024-11-09 02:14:36,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:36,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:36,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:14:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:36,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:14:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:36,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:14:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:36,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:14:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:36,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:14:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:36,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:14:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:36,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:14:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:36,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:14:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:36,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:14:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:36,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:14:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:36,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:14:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:36,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:14:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:36,983 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-09 02:14:36,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:14:36,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527711702] [2024-11-09 02:14:36,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527711702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:36,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:36,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:14:36,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446853853] [2024-11-09 02:14:36,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:36,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:14:36,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:14:36,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:14:36,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:14:36,985 INFO L87 Difference]: Start difference. First operand 222 states and 321 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:37,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:37,216 INFO L93 Difference]: Finished difference Result 539 states and 772 transitions. [2024-11-09 02:14:37,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:14:37,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-09 02:14:37,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:37,218 INFO L225 Difference]: With dead ends: 539 [2024-11-09 02:14:37,218 INFO L226 Difference]: Without dead ends: 320 [2024-11-09 02:14:37,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:14:37,220 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 232 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:37,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 599 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:14:37,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-09 02:14:37,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 246. [2024-11-09 02:14:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 219 states have (on average 1.3835616438356164) internal successors, (303), 219 states have internal predecessors, (303), 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-09 02:14:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 351 transitions. [2024-11-09 02:14:37,238 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 351 transitions. Word has length 108 [2024-11-09 02:14:37,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:37,239 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 351 transitions. [2024-11-09 02:14:37,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:37,239 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 351 transitions. [2024-11-09 02:14:37,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 02:14:37,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:37,240 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:37,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:14:37,240 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:37,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:37,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1112397672, now seen corresponding path program 1 times [2024-11-09 02:14:37,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:37,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892227568] [2024-11-09 02:14:37,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:37,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:38,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:14:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:38,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:14:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:38,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:14:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:38,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:14:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:38,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:14:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:38,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:14:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:38,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:14:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:38,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:14:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:38,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:14:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:38,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:14:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:38,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:14:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:38,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:14:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:38,228 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-09 02:14:38,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:14:38,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892227568] [2024-11-09 02:14:38,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892227568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:38,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:38,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 02:14:38,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086689597] [2024-11-09 02:14:38,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:38,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:14:38,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:14:38,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:14:38,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:14:38,231 INFO L87 Difference]: Start difference. First operand 246 states and 351 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:39,072 INFO L93 Difference]: Finished difference Result 472 states and 677 transitions. [2024-11-09 02:14:39,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 02:14:39,073 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-09 02:14:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:39,075 INFO L225 Difference]: With dead ends: 472 [2024-11-09 02:14:39,075 INFO L226 Difference]: Without dead ends: 333 [2024-11-09 02:14:39,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-11-09 02:14:39,077 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 201 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:39,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1335 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 02:14:39,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-09 02:14:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 268. [2024-11-09 02:14:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 241 states have (on average 1.4024896265560165) internal successors, (338), 241 states have internal predecessors, (338), 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-09 02:14:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 386 transitions. [2024-11-09 02:14:39,099 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 386 transitions. Word has length 109 [2024-11-09 02:14:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:39,100 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 386 transitions. [2024-11-09 02:14:39,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 386 transitions. [2024-11-09 02:14:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 02:14:39,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:39,101 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:39,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:14:39,102 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:39,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:39,103 INFO L85 PathProgramCache]: Analyzing trace with hash 101280422, now seen corresponding path program 1 times [2024-11-09 02:14:39,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:39,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252704481] [2024-11-09 02:14:39,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:39,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:39,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:14:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:39,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:14:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:39,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:14:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:39,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:14:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:39,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:14:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:39,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:14:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:39,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:14:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:39,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:14:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:39,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:14:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:39,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:14:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:39,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:14:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:39,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:14:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:39,686 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-09 02:14:39,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:14:39,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252704481] [2024-11-09 02:14:39,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252704481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:39,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:39,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:14:39,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107445697] [2024-11-09 02:14:39,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:39,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:14:39,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:14:39,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:14:39,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:14:39,688 INFO L87 Difference]: Start difference. First operand 268 states and 386 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:40,055 INFO L93 Difference]: Finished difference Result 484 states and 698 transitions. [2024-11-09 02:14:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:14:40,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-09 02:14:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:40,058 INFO L225 Difference]: With dead ends: 484 [2024-11-09 02:14:40,058 INFO L226 Difference]: Without dead ends: 323 [2024-11-09 02:14:40,059 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-09 02:14:40,060 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 275 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:40,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 598 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:14:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-09 02:14:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 268. [2024-11-09 02:14:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 241 states have (on average 1.3941908713692945) internal successors, (336), 241 states have internal predecessors, (336), 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-09 02:14:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 384 transitions. [2024-11-09 02:14:40,086 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 384 transitions. Word has length 109 [2024-11-09 02:14:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:40,086 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 384 transitions. [2024-11-09 02:14:40,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 384 transitions. [2024-11-09 02:14:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 02:14:40,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:40,089 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:40,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:14:40,089 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:40,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:40,090 INFO L85 PathProgramCache]: Analyzing trace with hash 978384166, now seen corresponding path program 1 times [2024-11-09 02:14:40,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:40,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495268966] [2024-11-09 02:14:40,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:40,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:41,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:14:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:41,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:14:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:41,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:14:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:41,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:14:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:41,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:14:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:41,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:14:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:41,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:14:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:41,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:14:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:41,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:14:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:41,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:14:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:41,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:14:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:41,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:14:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:41,938 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-09 02:14:41,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:14:41,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495268966] [2024-11-09 02:14:41,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495268966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:41,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:41,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 02:14:41,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381018872] [2024-11-09 02:14:41,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:41,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:14:41,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:14:41,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:14:41,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:14:41,942 INFO L87 Difference]: Start difference. First operand 268 states and 384 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 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-09 02:14:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:42,732 INFO L93 Difference]: Finished difference Result 507 states and 729 transitions. [2024-11-09 02:14:42,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:14:42,733 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 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 109 [2024-11-09 02:14:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:42,736 INFO L225 Difference]: With dead ends: 507 [2024-11-09 02:14:42,736 INFO L226 Difference]: Without dead ends: 346 [2024-11-09 02:14:42,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:14:42,737 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 546 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:42,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 672 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:14:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-09 02:14:42,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 283. [2024-11-09 02:14:42,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 256 states have (on average 1.40234375) internal successors, (359), 256 states have internal predecessors, (359), 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-09 02:14:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 407 transitions. [2024-11-09 02:14:42,766 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 407 transitions. Word has length 109 [2024-11-09 02:14:42,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:42,766 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 407 transitions. [2024-11-09 02:14:42,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 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-09 02:14:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 407 transitions. [2024-11-09 02:14:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 02:14:42,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:42,768 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:42,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 02:14:42,769 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:42,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash -32733084, now seen corresponding path program 1 times [2024-11-09 02:14:42,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:42,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036603800] [2024-11-09 02:14:42,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:42,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:43,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:14:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:43,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:14:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:43,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:14:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:43,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:14:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:43,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:14:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:43,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:14:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:43,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:14:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:14:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:43,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:14:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:43,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:14:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:43,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:14:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:43,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:14:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:43,259 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-09 02:14:43,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:14:43,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036603800] [2024-11-09 02:14:43,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036603800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:43,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:43,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:14:43,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157096916] [2024-11-09 02:14:43,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:43,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:14:43,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:14:43,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:14:43,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:14:43,262 INFO L87 Difference]: Start difference. First operand 283 states and 407 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:43,772 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2024-11-09 02:14:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 02:14:43,772 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-09 02:14:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:43,774 INFO L225 Difference]: With dead ends: 524 [2024-11-09 02:14:43,774 INFO L226 Difference]: Without dead ends: 348 [2024-11-09 02:14:43,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-09 02:14:43,775 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 196 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:43,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1095 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:14:43,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-09 02:14:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 283. [2024-11-09 02:14:43,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 256 states have (on average 1.40234375) internal successors, (359), 256 states have internal predecessors, (359), 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-09 02:14:43,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 407 transitions. [2024-11-09 02:14:43,800 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 407 transitions. Word has length 109 [2024-11-09 02:14:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:43,801 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 407 transitions. [2024-11-09 02:14:43,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 407 transitions. [2024-11-09 02:14:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 02:14:43,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:43,802 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:43,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 02:14:43,803 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:43,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:43,803 INFO L85 PathProgramCache]: Analyzing trace with hash -846099282, now seen corresponding path program 1 times [2024-11-09 02:14:43,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:43,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553139118] [2024-11-09 02:14:43,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:43,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:44,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:14:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:44,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:14:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:44,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:14:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:44,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:14:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:44,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:14:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:44,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:14:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:44,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:14:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:44,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:14:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:44,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:14:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:44,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:14:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:44,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:14:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:44,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:14:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:44,456 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-09 02:14:44,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:14:44,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553139118] [2024-11-09 02:14:44,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553139118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:44,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:44,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:14:44,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698234429] [2024-11-09 02:14:44,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:44,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:14:44,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:14:44,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:14:44,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:14:44,458 INFO L87 Difference]: Start difference. First operand 283 states and 407 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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-09 02:14:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:45,039 INFO L93 Difference]: Finished difference Result 620 states and 894 transitions. [2024-11-09 02:14:45,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:14:45,040 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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 109 [2024-11-09 02:14:45,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:45,043 INFO L225 Difference]: With dead ends: 620 [2024-11-09 02:14:45,043 INFO L226 Difference]: Without dead ends: 444 [2024-11-09 02:14:45,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:14:45,045 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 256 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:45,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 622 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:14:45,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-09 02:14:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 279. [2024-11-09 02:14:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 252 states have (on average 1.3928571428571428) internal successors, (351), 252 states have internal predecessors, (351), 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-09 02:14:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 399 transitions. [2024-11-09 02:14:45,074 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 399 transitions. Word has length 109 [2024-11-09 02:14:45,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:45,075 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 399 transitions. [2024-11-09 02:14:45,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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-09 02:14:45,075 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 399 transitions. [2024-11-09 02:14:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 02:14:45,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:45,080 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:45,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 02:14:45,080 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:45,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:45,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1438926694, now seen corresponding path program 1 times [2024-11-09 02:14:45,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:45,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438640919] [2024-11-09 02:14:45,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:45,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:45,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:14:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:45,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:14:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:45,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:14:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:45,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:14:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:45,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:14:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:14:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:45,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:14:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:45,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:14:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:45,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:14:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:45,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:14:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:45,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:14:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:45,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:14:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:14:45,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:14:45,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438640919] [2024-11-09 02:14:45,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438640919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:45,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:45,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:14:45,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030566047] [2024-11-09 02:14:45,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:45,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:14:45,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:14:45,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:14:45,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:14:45,742 INFO L87 Difference]: Start difference. First operand 279 states and 399 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-09 02:14:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:46,217 INFO L93 Difference]: Finished difference Result 359 states and 508 transitions. [2024-11-09 02:14:46,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:14:46,218 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 110 [2024-11-09 02:14:46,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:46,221 INFO L225 Difference]: With dead ends: 359 [2024-11-09 02:14:46,221 INFO L226 Difference]: Without dead ends: 357 [2024-11-09 02:14:46,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:14:46,222 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 549 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:46,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 574 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:14:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-09 02:14:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 337. [2024-11-09 02:14:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 310 states have (on average 1.4) internal successors, (434), 310 states have internal predecessors, (434), 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-09 02:14:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 482 transitions. [2024-11-09 02:14:46,253 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 482 transitions. Word has length 110 [2024-11-09 02:14:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:46,254 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 482 transitions. [2024-11-09 02:14:46,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-09 02:14:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 482 transitions. [2024-11-09 02:14:46,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 02:14:46,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:46,257 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:46,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 02:14:46,257 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:46,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1440773736, now seen corresponding path program 1 times [2024-11-09 02:14:46,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:46,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071447173] [2024-11-09 02:14:46,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:14:46,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:14:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:14:46,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:14:46,528 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:14:46,529 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 02:14:46,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 02:14:46,535 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:46,707 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:14:46,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:14:46 BoogieIcfgContainer [2024-11-09 02:14:46,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:14:46,712 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:14:46,712 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:14:46,712 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:14:46,713 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:14:29" (3/4) ... [2024-11-09 02:14:46,715 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 02:14:46,716 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:14:46,717 INFO L158 Benchmark]: Toolchain (without parser) took 19072.76ms. Allocated memory was 163.6MB in the beginning and 585.1MB in the end (delta: 421.5MB). Free memory was 116.1MB in the beginning and 542.7MB in the end (delta: -426.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:14:46,717 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 163.6MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:14:46,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.77ms. Allocated memory is still 163.6MB. Free memory was 115.5MB in the beginning and 98.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 02:14:46,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.38ms. Allocated memory is still 163.6MB. Free memory was 98.7MB in the beginning and 95.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:14:46,718 INFO L158 Benchmark]: Boogie Preprocessor took 71.17ms. Allocated memory is still 163.6MB. Free memory was 95.1MB in the beginning and 92.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:14:46,719 INFO L158 Benchmark]: RCFGBuilder took 909.76ms. Allocated memory is still 163.6MB. Free memory was 91.6MB in the beginning and 57.4MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-09 02:14:46,719 INFO L158 Benchmark]: TraceAbstraction took 17591.96ms. Allocated memory was 163.6MB in the beginning and 585.1MB in the end (delta: 421.5MB). Free memory was 56.8MB in the beginning and 543.7MB in the end (delta: -487.0MB). Peak memory consumption was 220.7MB. Max. memory is 16.1GB. [2024-11-09 02:14:46,719 INFO L158 Benchmark]: Witness Printer took 4.46ms. Allocated memory is still 585.1MB. Free memory was 543.7MB in the beginning and 542.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:14:46,721 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.20ms. Allocated memory is still 163.6MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.77ms. Allocated memory is still 163.6MB. Free memory was 115.5MB in the beginning and 98.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.38ms. Allocated memory is still 163.6MB. Free memory was 98.7MB in the beginning and 95.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.17ms. Allocated memory is still 163.6MB. Free memory was 95.1MB in the beginning and 92.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 909.76ms. Allocated memory is still 163.6MB. Free memory was 91.6MB in the beginning and 57.4MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17591.96ms. Allocated memory was 163.6MB in the beginning and 585.1MB in the end (delta: 421.5MB). Free memory was 56.8MB in the beginning and 543.7MB in the end (delta: -487.0MB). Peak memory consumption was 220.7MB. Max. memory is 16.1GB. * Witness Printer took 4.46ms. Allocated memory is still 585.1MB. Free memory was 543.7MB in the beginning and 542.7MB 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 113, overapproximation of someBinaryFLOATComparisonOperation at line 121. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; [L51] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] unsigned char* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L53] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L54] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L55] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L56] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L57] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L58] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L59] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L60] float* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L61] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L62] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=0] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] FCALL updateLastVariables() [L129] CALL updateVariables() [L98] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L101] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L104] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L107] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L110] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_12 [L111] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_12 [L111] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L111] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L113] EXPR WrapperStruct00.var_1_13 [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_13 [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L113] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L114] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L115] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L116] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L129] RET updateVariables() [L130] CALL step() [L66] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L66] (*(WrapperStruct00_var_1_14_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L67] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L67] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L68] signed long int stepLocal_0 = -4; [L69] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1, stepLocal_0=-4] [L69] COND FALSE !(stepLocal_0 >= (*(WrapperStruct00_var_1_15_Pointer))) [L72] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L72] unsigned char stepLocal_2 = (*(WrapperStruct00_var_1_3_Pointer)); [L73] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1, stepLocal_2=254] [L73] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer))) [L82] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1, stepLocal_2=254] [L82] EXPR ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer))) [L82] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L82] EXPR ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1, stepLocal_2=254] [L82] signed long int stepLocal_1 = (((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))); [L83] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1, stepLocal_1=16, stepLocal_2=254] [L83] COND FALSE !((8 * (*(WrapperStruct00_var_1_1_Pointer))) == stepLocal_1) [L94] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L94] (*(WrapperStruct00_var_1_4_Pointer)) = (*(WrapperStruct00_var_1_10_Pointer)) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer))) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L121] EXPR ((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L121] EXPR ((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121-L122] return (((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 15, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2998 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2997 mSDsluCounter, 8423 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6374 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3783 IncrementalHoareTripleChecker+Invalid, 3937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 2049 mSDtfsCounter, 3783 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 387 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=337occurred in iteration=14, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 630 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 1620 NumberOfCodeBlocks, 1620 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1496 ConstructedInterpolants, 0 QuantifiedInterpolants, 9851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 3696/3696 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-09 02:14:46,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4adac79d6cea52ff1f2363c41bfef3a91ebf33bfb8642b8f2d3700c04ed5429 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:14:49,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:14:49,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 02:14:49,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:14:49,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:14:49,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:14:49,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:14:49,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:14:49,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:14:49,145 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:14:49,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:14:49,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:14:49,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:14:49,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:14:49,150 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:14:49,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:14:49,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:14:49,151 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:14:49,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:14:49,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:14:49,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:14:49,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:14:49,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:14:49,157 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 02:14:49,157 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 02:14:49,158 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:14:49,158 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 02:14:49,158 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:14:49,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:14:49,158 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:14:49,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:14:49,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:14:49,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:14:49,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:14:49,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:14:49,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:14:49,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:14:49,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:14:49,163 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 02:14:49,163 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 02:14:49,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:14:49,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:14:49,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:14:49,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:14:49,165 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 -> a4adac79d6cea52ff1f2363c41bfef3a91ebf33bfb8642b8f2d3700c04ed5429 [2024-11-09 02:14:49,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:14:49,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:14:49,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:14:49,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:14:49,540 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:14:49,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i [2024-11-09 02:14:51,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:14:51,363 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:14:51,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i [2024-11-09 02:14:51,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e195702/06baaa46992248ef9fc9d3ce3f4a28ed/FLAGe3ea17a29 [2024-11-09 02:14:51,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e195702/06baaa46992248ef9fc9d3ce3f4a28ed [2024-11-09 02:14:51,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:14:51,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:14:51,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:14:51,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:14:51,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:14:51,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:14:51" (1/1) ... [2024-11-09 02:14:51,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50834cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:51, skipping insertion in model container [2024-11-09 02:14:51,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:14:51" (1/1) ... [2024-11-09 02:14:51,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:14:51,653 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-54.i[917,930] [2024-11-09 02:14:51,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:14:51,769 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:14:51,782 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-54.i[917,930] [2024-11-09 02:14:51,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:14:51,865 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:14:51,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:51 WrapperNode [2024-11-09 02:14:51,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:14:51,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:14:51,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:14:51,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:14:51,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:51" (1/1) ... [2024-11-09 02:14:51,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:51" (1/1) ... [2024-11-09 02:14:51,950 INFO L138 Inliner]: procedures = 34, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 474 [2024-11-09 02:14:51,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:14:51,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:14:51,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:14:51,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:14:51,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:51" (1/1) ... [2024-11-09 02:14:51,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:51" (1/1) ... [2024-11-09 02:14:51,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:51" (1/1) ... [2024-11-09 02:14:52,013 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2024-11-09 02:14:52,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:51" (1/1) ... [2024-11-09 02:14:52,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:51" (1/1) ... [2024-11-09 02:14:52,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:51" (1/1) ... [2024-11-09 02:14:52,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:51" (1/1) ... [2024-11-09 02:14:52,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:51" (1/1) ... [2024-11-09 02:14:52,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:51" (1/1) ... [2024-11-09 02:14:52,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:14:52,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:14:52,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:14:52,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:14:52,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:51" (1/1) ... [2024-11-09 02:14:52,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:14:52,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:14:52,093 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-09 02:14:52,099 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-09 02:14:52,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:14:52,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 02:14:52,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 02:14:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-09 02:14:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-09 02:14:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 02:14:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 02:14:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 02:14:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 02:14:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 02:14:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 02:14:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 02:14:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 02:14:52,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 02:14:52,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 02:14:52,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-09 02:14:52,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-09 02:14:52,141 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:14:52,141 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:14:52,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-09 02:14:52,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-09 02:14:52,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:14:52,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:14:52,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 02:14:52,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 02:14:52,297 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:14:52,299 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:14:54,483 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-09 02:14:54,483 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:14:54,502 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:14:54,503 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:14:54,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:14:54 BoogieIcfgContainer [2024-11-09 02:14:54,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:14:54,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:14:54,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:14:54,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:14:54,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:14:51" (1/3) ... [2024-11-09 02:14:54,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265ef90e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:14:54, skipping insertion in model container [2024-11-09 02:14:54,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:14:51" (2/3) ... [2024-11-09 02:14:54,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265ef90e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:14:54, skipping insertion in model container [2024-11-09 02:14:54,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:14:54" (3/3) ... [2024-11-09 02:14:54,521 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-54.i [2024-11-09 02:14:54,540 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:14:54,540 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:14:54,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:14:54,625 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;@40fd5252, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:14:54,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:14:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:14:54,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 02:14:54,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:54,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] [2024-11-09 02:14:54,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:54,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:54,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2063923592, now seen corresponding path program 1 times [2024-11-09 02:14:54,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:14:54,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917956430] [2024-11-09 02:14:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:54,671 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-09 02:14:54,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:14:54,674 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-09 02:14:54,677 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-09 02:14:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:55,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 02:14:55,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:55,142 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-09 02:14:55,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:14:55,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:14:55,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917956430] [2024-11-09 02:14:55,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917956430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:55,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:55,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:14:55,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802417899] [2024-11-09 02:14:55,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:55,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:14:55,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:14:55,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:14:55,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:14:55,182 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:14:55,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:55,224 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-11-09 02:14:55,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:14:55,227 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-09 02:14:55,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:55,235 INFO L225 Difference]: With dead ends: 213 [2024-11-09 02:14:55,235 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 02:14:55,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:14:55,245 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:55,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:14:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 02:14:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 02:14:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:14:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-09 02:14:55,301 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2024-11-09 02:14:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:55,302 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-09 02:14:55,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:14:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-09 02:14:55,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 02:14:55,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:55,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] [2024-11-09 02:14:55,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 02:14:55,514 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-09 02:14:55,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:55,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:55,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1289475548, now seen corresponding path program 1 times [2024-11-09 02:14:55,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:14:55,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809560601] [2024-11-09 02:14:55,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:55,517 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-09 02:14:55,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:14:55,520 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-09 02:14:55,521 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-09 02:14:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:55,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:14:55,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:55,920 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-09 02:14:55,923 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:14:55,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:14:55,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809560601] [2024-11-09 02:14:55,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809560601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:55,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:55,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:14:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541417829] [2024-11-09 02:14:55,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:55,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:14:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:14:55,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:14:55,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:14:55,928 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:55,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:55,997 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-09 02:14:55,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:14:55,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-09 02:14:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:56,000 INFO L225 Difference]: With dead ends: 211 [2024-11-09 02:14:56,000 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 02:14:56,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:14:56,002 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-09 02:14:56,003 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-09 02:14:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 02:14:56,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 02:14:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:14:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-09 02:14:56,019 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2024-11-09 02:14:56,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:56,021 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-09 02:14:56,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-09 02:14:56,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 02:14:56,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:56,023 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:56,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 02:14:56,224 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-09 02:14:56,225 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:56,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:56,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1249640545, now seen corresponding path program 1 times [2024-11-09 02:14:56,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:14:56,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171623901] [2024-11-09 02:14:56,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:56,226 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-09 02:14:56,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:14:56,230 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-09 02:14:56,231 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-09 02:14:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:56,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:14:56,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:56,613 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-09 02:14:56,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:14:56,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:14:56,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171623901] [2024-11-09 02:14:56,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171623901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:56,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:56,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:14:56,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520115865] [2024-11-09 02:14:56,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:56,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:14:56,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:14:56,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:14:56,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:14:56,617 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:56,779 INFO L93 Difference]: Finished difference Result 218 states and 318 transitions. [2024-11-09 02:14:56,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:14:56,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-09 02:14:56,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:56,786 INFO L225 Difference]: With dead ends: 218 [2024-11-09 02:14:56,786 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 02:14:56,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:14:56,792 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:56,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:14:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 02:14:56,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-09 02:14:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:14:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-09 02:14:56,811 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 107 [2024-11-09 02:14:56,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:56,812 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-09 02:14:56,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-09 02:14:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 02:14:56,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:56,818 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:56,835 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-09 02:14:57,019 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-09 02:14:57,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:57,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash 525366817, now seen corresponding path program 1 times [2024-11-09 02:14:57,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:14:57,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631047261] [2024-11-09 02:14:57,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:57,021 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-09 02:14:57,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:14:57,024 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-09 02:14:57,026 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-09 02:14:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:57,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 02:14:57,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:57,428 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-09 02:14:57,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:14:57,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:14:57,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631047261] [2024-11-09 02:14:57,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631047261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:57,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:57,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:14:57,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063633402] [2024-11-09 02:14:57,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:57,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:14:57,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:14:57,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:14:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:14:57,432 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:57,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:57,587 INFO L93 Difference]: Finished difference Result 224 states and 323 transitions. [2024-11-09 02:14:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:14:57,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-09 02:14:57,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:57,595 INFO L225 Difference]: With dead ends: 224 [2024-11-09 02:14:57,596 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 02:14:57,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:14:57,597 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:57,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:14:57,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 02:14:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-09 02:14:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:14:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2024-11-09 02:14:57,618 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 107 [2024-11-09 02:14:57,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:57,619 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2024-11-09 02:14:57,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:14:57,620 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2024-11-09 02:14:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 02:14:57,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:57,626 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:57,639 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-09 02:14:57,826 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-09 02:14:57,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:57,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:57,827 INFO L85 PathProgramCache]: Analyzing trace with hash 527213859, now seen corresponding path program 1 times [2024-11-09 02:14:57,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:14:57,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078841909] [2024-11-09 02:14:57,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:57,828 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-09 02:14:57,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:14:57,832 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-09 02:14:57,833 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-09 02:14:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:58,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 02:14:58,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:58,400 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 58 treesize of output 57 [2024-11-09 02:14:58,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 83 [2024-11-09 02:15:00,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2024-11-09 02:15:01,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 85 [2024-11-09 02:15:03,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2024-11-09 02:15:05,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 91 [2024-11-09 02:15:14,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 85 [2024-11-09 02:15:34,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 79