./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.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 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:21:51,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:21:51,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:21:51,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:21:51,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:21:51,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:21:51,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:21:51,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:21:51,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:21:51,707 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:21:51,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:21:51,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:21:51,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:21:51,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:21:51,708 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:21:51,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:21:51,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:21:51,710 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:21:51,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:21:51,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:21:51,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:21:51,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:21:51,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:21:51,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:21:51,712 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:21:51,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:21:51,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:21:51,713 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:21:51,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:21:51,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:21:51,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:21:51,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:21:51,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:21:51,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:21:51,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:21:51,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:21:51,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:21:51,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:21:51,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:21:51,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:21:51,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:21:51,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:21:51,716 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 -> 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 [2024-11-22 13:21:51,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:21:51,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:21:51,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:21:51,954 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:21:51,954 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:21:51,955 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-8.i [2024-11-22 13:21:53,220 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:21:53,380 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:21:53,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-22 13:21:53,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e22a8a29/fc030ffc5f7e4b888725a19be22edb09/FLAG01827fc74 [2024-11-22 13:21:53,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e22a8a29/fc030ffc5f7e4b888725a19be22edb09 [2024-11-22 13:21:53,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:21:53,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:21:53,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:21:53,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:21:53,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:21:53,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:21:53" (1/1) ... [2024-11-22 13:21:53,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b0da2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:21:53, skipping insertion in model container [2024-11-22 13:21:53,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:21:53" (1/1) ... [2024-11-22 13:21:53,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:21:53,599 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-8.i[916,929] [2024-11-22 13:21:53,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:21:53,677 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:21:53,687 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-8.i[916,929] [2024-11-22 13:21:53,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:21:53,793 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:21:53,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:21:53 WrapperNode [2024-11-22 13:21:53,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:21:53,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:21:53,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:21:53,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:21:53,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:21:53" (1/1) ... [2024-11-22 13:21:53,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:21:53" (1/1) ... [2024-11-22 13:21:53,853 INFO L138 Inliner]: procedures = 30, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 458 [2024-11-22 13:21:53,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:21:53,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:21:53,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:21:53,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:21:53,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:21:53" (1/1) ... [2024-11-22 13:21:53,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:21:53" (1/1) ... [2024-11-22 13:21:53,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:21:53" (1/1) ... [2024-11-22 13:21:53,876 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-22 13:21:53,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:21:53" (1/1) ... [2024-11-22 13:21:53,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:21:53" (1/1) ... [2024-11-22 13:21:53,886 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:21:53" (1/1) ... [2024-11-22 13:21:53,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:21:53" (1/1) ... [2024-11-22 13:21:53,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:21:53" (1/1) ... [2024-11-22 13:21:53,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:21:53" (1/1) ... [2024-11-22 13:21:53,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:21:53,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:21:53,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:21:53,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:21:53,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:21:53" (1/1) ... [2024-11-22 13:21:53,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:21:53,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:21:53,958 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-22 13:21:53,960 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-22 13:21:54,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:21:54,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-22 13:21:54,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-22 13:21:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-22 13:21:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-22 13:21:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-22 13:21:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-22 13:21:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:21:54,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:21:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-22 13:21:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:21:54,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:21:54,107 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:21:54,108 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:21:54,579 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-22 13:21:54,580 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:21:54,593 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:21:54,593 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:21:54,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:21:54 BoogieIcfgContainer [2024-11-22 13:21:54,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:21:54,595 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:21:54,595 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:21:54,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:21:54,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:21:53" (1/3) ... [2024-11-22 13:21:54,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53733b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:21:54, skipping insertion in model container [2024-11-22 13:21:54,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:21:53" (2/3) ... [2024-11-22 13:21:54,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53733b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:21:54, skipping insertion in model container [2024-11-22 13:21:54,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:21:54" (3/3) ... [2024-11-22 13:21:54,602 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-22 13:21:54,615 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:21:54,616 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:21:54,678 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:21:54,683 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;@478bee38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:21:54,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:21:54,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:21:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 13:21:54,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:21:54,700 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:21:54,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:21:54,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:21:54,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1431925537, now seen corresponding path program 1 times [2024-11-22 13:21:54,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:21:54,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317054503] [2024-11-22 13:21:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:21:54,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:21:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:21:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-22 13:21:55,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:21:55,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317054503] [2024-11-22 13:21:55,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317054503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:21:55,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445524087] [2024-11-22 13:21:55,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:21:55,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:21:55,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:21:55,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:21:55,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 13:21:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:21:55,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 13:21:55,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:21:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-22 13:21:55,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:21:55,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445524087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:21:55,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:21:55,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 13:21:55,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577341467] [2024-11-22 13:21:55,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:21:55,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:21:55,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:21:55,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:21:55,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:21:55,431 INFO L87 Difference]: Start difference. First operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 13:21:55,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:21:55,456 INFO L93 Difference]: Finished difference Result 193 states and 298 transitions. [2024-11-22 13:21:55,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:21:55,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-22 13:21:55,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:21:55,464 INFO L225 Difference]: With dead ends: 193 [2024-11-22 13:21:55,464 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 13:21:55,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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-22 13:21:55,469 INFO L432 NwaCegarLoop]: 138 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, 138 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-22 13:21:55,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:21:55,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 13:21:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-22 13:21:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:21:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-22 13:21:55,502 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 123 [2024-11-22 13:21:55,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:21:55,502 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-22 13:21:55,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 13:21:55,503 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-22 13:21:55,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 13:21:55,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:21:55,507 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:21:55,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 13:21:55,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 13:21:55,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:21:55,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:21:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2107248781, now seen corresponding path program 1 times [2024-11-22 13:21:55,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:21:55,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477070612] [2024-11-22 13:21:55,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:21:55,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:21:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:21:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 13:21:55,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:21:55,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477070612] [2024-11-22 13:21:55,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477070612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:21:55,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:21:56,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:21:56,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996742181] [2024-11-22 13:21:56,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:21:56,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:21:56,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:21:56,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:21:56,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:21:56,001 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 13:21:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:21:56,042 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2024-11-22 13:21:56,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:21:56,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-22 13:21:56,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:21:56,044 INFO L225 Difference]: With dead ends: 191 [2024-11-22 13:21:56,044 INFO L226 Difference]: Without dead ends: 98 [2024-11-22 13:21:56,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-22 13:21:56,045 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 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-22 13:21:56,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:21:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-22 13:21:56,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-22 13:21:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:21:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-22 13:21:56,076 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 123 [2024-11-22 13:21:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:21:56,079 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-22 13:21:56,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 13:21:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-22 13:21:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 13:21:56,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:21:56,084 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:21:56,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:21:56,084 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:21:56,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:21:56,085 INFO L85 PathProgramCache]: Analyzing trace with hash 568908751, now seen corresponding path program 1 times [2024-11-22 13:21:56,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:21:56,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462062336] [2024-11-22 13:21:56,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:21:56,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:21:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:21:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 13:21:56,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:21:56,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462062336] [2024-11-22 13:21:56,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462062336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:21:56,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:21:56,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:21:56,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417910414] [2024-11-22 13:21:56,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:21:56,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:21:56,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:21:56,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:21:56,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:21:56,291 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:21:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:21:56,321 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2024-11-22 13:21:56,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:21:56,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-22 13:21:56,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:21:56,324 INFO L225 Difference]: With dead ends: 196 [2024-11-22 13:21:56,325 INFO L226 Difference]: Without dead ends: 101 [2024-11-22 13:21:56,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-22 13:21:56,326 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 394 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-22 13:21:56,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 394 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:21:56,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-22 13:21:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-22 13:21:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:21:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-22 13:21:56,333 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 123 [2024-11-22 13:21:56,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:21:56,334 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-22 13:21:56,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:21:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-22 13:21:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 13:21:56,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:21:56,336 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:21:56,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:21:56,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:21:56,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:21:56,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1248967121, now seen corresponding path program 1 times [2024-11-22 13:21:56,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:21:56,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963657646] [2024-11-22 13:21:56,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:21:56,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:21:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:21:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 13:21:56,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:21:56,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963657646] [2024-11-22 13:21:56,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963657646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:21:56,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:21:56,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:21:56,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032198454] [2024-11-22 13:21:56,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:21:56,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:21:56,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:21:56,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:21:56,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:21:56,518 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:21:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:21:56,551 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2024-11-22 13:21:56,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:21:56,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-22 13:21:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:21:56,555 INFO L225 Difference]: With dead ends: 200 [2024-11-22 13:21:56,555 INFO L226 Difference]: Without dead ends: 103 [2024-11-22 13:21:56,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-22 13:21:56,557 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:21:56,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 395 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:21:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-22 13:21:56,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-22 13:21:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:21:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-11-22 13:21:56,572 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 123 [2024-11-22 13:21:56,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:21:56,573 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-11-22 13:21:56,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:21:56,573 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-11-22 13:21:56,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 13:21:56,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:21:56,579 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:21:56,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:21:56,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:21:56,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:21:56,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1270992813, now seen corresponding path program 1 times [2024-11-22 13:21:56,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:21:56,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762967422] [2024-11-22 13:21:56,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:21:56,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:21:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:21:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 13:21:57,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:21:57,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762967422] [2024-11-22 13:21:57,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762967422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:21:57,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:21:57,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:21:57,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562180160] [2024-11-22 13:21:57,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:21:57,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:21:57,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:21:57,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:21:57,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:21:57,252 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:21:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:21:57,420 INFO L93 Difference]: Finished difference Result 203 states and 287 transitions. [2024-11-22 13:21:57,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:21:57,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-22 13:21:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:21:57,422 INFO L225 Difference]: With dead ends: 203 [2024-11-22 13:21:57,422 INFO L226 Difference]: Without dead ends: 104 [2024-11-22 13:21:57,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:21:57,423 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 95 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:21:57,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 306 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:21:57,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-22 13:21:57,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2024-11-22 13:21:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:21:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2024-11-22 13:21:57,430 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 123 [2024-11-22 13:21:57,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:21:57,430 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2024-11-22 13:21:57,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:21:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2024-11-22 13:21:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 13:21:57,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:21:57,432 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:21:57,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 13:21:57,432 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:21:57,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:21:57,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1335030741, now seen corresponding path program 1 times [2024-11-22 13:21:57,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:21:57,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993813165] [2024-11-22 13:21:57,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:21:57,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:21:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:21:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 13:21:59,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:21:59,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993813165] [2024-11-22 13:21:59,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993813165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:21:59,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:21:59,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-22 13:21:59,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687118146] [2024-11-22 13:21:59,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:21:59,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 13:21:59,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:21:59,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 13:21:59,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-22 13:21:59,830 INFO L87 Difference]: Start difference. First operand 102 states and 143 transitions. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-22 13:22:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:00,324 INFO L93 Difference]: Finished difference Result 237 states and 331 transitions. [2024-11-22 13:22:00,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:22:00,324 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2024-11-22 13:22:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:00,326 INFO L225 Difference]: With dead ends: 237 [2024-11-22 13:22:00,326 INFO L226 Difference]: Without dead ends: 138 [2024-11-22 13:22:00,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2024-11-22 13:22:00,327 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 344 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:22:00,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 402 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:22:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-22 13:22:00,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2024-11-22 13:22:00,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:22:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-11-22 13:22:00,347 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 123 [2024-11-22 13:22:00,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:00,347 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-11-22 13:22:00,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-22 13:22:00,347 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-11-22 13:22:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-22 13:22:00,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:00,348 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:00,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:22:00,349 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:00,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:00,349 INFO L85 PathProgramCache]: Analyzing trace with hash 375638192, now seen corresponding path program 1 times [2024-11-22 13:22:00,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:22:00,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033039389] [2024-11-22 13:22:00,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:00,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:22:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 13:22:01,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:22:01,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033039389] [2024-11-22 13:22:01,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033039389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:22:01,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:22:01,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 13:22:01,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80155012] [2024-11-22 13:22:01,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:22:01,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 13:22:01,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:22:01,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 13:22:01,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-22 13:22:01,572 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:22:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:02,292 INFO L93 Difference]: Finished difference Result 243 states and 337 transitions. [2024-11-22 13:22:02,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:22:02,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-22 13:22:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:02,294 INFO L225 Difference]: With dead ends: 243 [2024-11-22 13:22:02,294 INFO L226 Difference]: Without dead ends: 140 [2024-11-22 13:22:02,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-22 13:22:02,295 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 233 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 13:22:02,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 577 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 13:22:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-22 13:22:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 106. [2024-11-22 13:22:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:22:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2024-11-22 13:22:02,307 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 125 [2024-11-22 13:22:02,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:02,307 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2024-11-22 13:22:02,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:22:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2024-11-22 13:22:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-22 13:22:02,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:02,308 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:02,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 13:22:02,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:02,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:02,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665936, now seen corresponding path program 1 times [2024-11-22 13:22:02,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:22:02,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219636677] [2024-11-22 13:22:02,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:02,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:22:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 13:22:03,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:22:03,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219636677] [2024-11-22 13:22:03,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219636677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:22:03,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:22:03,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 13:22:03,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007549821] [2024-11-22 13:22:03,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:22:03,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 13:22:03,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:22:03,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 13:22:03,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:22:03,814 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-22 13:22:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:04,830 INFO L93 Difference]: Finished difference Result 237 states and 326 transitions. [2024-11-22 13:22:04,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 13:22:04,830 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2024-11-22 13:22:04,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:04,831 INFO L225 Difference]: With dead ends: 237 [2024-11-22 13:22:04,831 INFO L226 Difference]: Without dead ends: 134 [2024-11-22 13:22:04,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2024-11-22 13:22:04,832 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 431 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 13:22:04,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 367 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 13:22:04,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-22 13:22:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 106. [2024-11-22 13:22:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:22:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 146 transitions. [2024-11-22 13:22:04,850 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 146 transitions. Word has length 125 [2024-11-22 13:22:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:04,851 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 146 transitions. [2024-11-22 13:22:04,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-22 13:22:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2024-11-22 13:22:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-22 13:22:04,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:04,853 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:04,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 13:22:04,853 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:04,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:04,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1444028551, now seen corresponding path program 1 times [2024-11-22 13:22:04,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:22:04,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131597764] [2024-11-22 13:22:04,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:04,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:22:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-22 13:22:06,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:22:06,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131597764] [2024-11-22 13:22:06,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131597764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:22:06,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:22:06,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-22 13:22:06,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578556971] [2024-11-22 13:22:06,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:22:06,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 13:22:06,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:22:06,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 13:22:06,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-22 13:22:06,883 INFO L87 Difference]: Start difference. First operand 106 states and 146 transitions. Second operand has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-22 13:22:08,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:08,430 INFO L93 Difference]: Finished difference Result 268 states and 372 transitions. [2024-11-22 13:22:08,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 13:22:08,430 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2024-11-22 13:22:08,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:08,431 INFO L225 Difference]: With dead ends: 268 [2024-11-22 13:22:08,431 INFO L226 Difference]: Without dead ends: 165 [2024-11-22 13:22:08,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2024-11-22 13:22:08,432 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 373 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 13:22:08,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 539 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 13:22:08,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-22 13:22:08,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2024-11-22 13:22:08,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 132 states have internal predecessors, (171), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 13:22:08,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 223 transitions. [2024-11-22 13:22:08,453 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 223 transitions. Word has length 125 [2024-11-22 13:22:08,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:08,453 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 223 transitions. [2024-11-22 13:22:08,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-22 13:22:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 223 transitions. [2024-11-22 13:22:08,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-22 13:22:08,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:08,454 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:08,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 13:22:08,455 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:08,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:08,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1780572309, now seen corresponding path program 1 times [2024-11-22 13:22:08,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:22:08,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148087870] [2024-11-22 13:22:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:08,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:22:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 13:22:08,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:22:08,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148087870] [2024-11-22 13:22:08,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148087870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:22:08,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:22:08,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:22:08,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758615846] [2024-11-22 13:22:08,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:22:08,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:22:08,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:22:08,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:22:08,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:22:08,844 INFO L87 Difference]: Start difference. First operand 160 states and 223 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:22:09,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:09,011 INFO L93 Difference]: Finished difference Result 307 states and 421 transitions. [2024-11-22 13:22:09,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:22:09,012 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-22 13:22:09,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:09,014 INFO L225 Difference]: With dead ends: 307 [2024-11-22 13:22:09,014 INFO L226 Difference]: Without dead ends: 201 [2024-11-22 13:22:09,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:22:09,015 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 43 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:22:09,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 957 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:22:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-22 13:22:09,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 165. [2024-11-22 13:22:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 136 states have (on average 1.3014705882352942) internal successors, (177), 137 states have internal predecessors, (177), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 13:22:09,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 229 transitions. [2024-11-22 13:22:09,034 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 229 transitions. Word has length 127 [2024-11-22 13:22:09,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:09,035 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 229 transitions. [2024-11-22 13:22:09,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:22:09,035 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 229 transitions. [2024-11-22 13:22:09,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-22 13:22:09,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:09,036 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:09,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 13:22:09,036 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:09,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:09,037 INFO L85 PathProgramCache]: Analyzing trace with hash -696788308, now seen corresponding path program 1 times [2024-11-22 13:22:09,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:22:09,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062770521] [2024-11-22 13:22:09,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:09,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:22:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 13:22:11,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:22:11,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062770521] [2024-11-22 13:22:11,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062770521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:22:11,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:22:11,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-22 13:22:11,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112988528] [2024-11-22 13:22:11,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:22:11,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 13:22:11,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:22:11,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 13:22:11,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-11-22 13:22:11,601 INFO L87 Difference]: Start difference. First operand 165 states and 229 transitions. Second operand has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-22 13:22:13,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:13,480 INFO L93 Difference]: Finished difference Result 280 states and 386 transitions. [2024-11-22 13:22:13,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 13:22:13,481 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 127 [2024-11-22 13:22:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:13,482 INFO L225 Difference]: With dead ends: 280 [2024-11-22 13:22:13,482 INFO L226 Difference]: Without dead ends: 169 [2024-11-22 13:22:13,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2024-11-22 13:22:13,483 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 414 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:22:13,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 674 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 13:22:13,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-22 13:22:13,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2024-11-22 13:22:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 138 states have internal predecessors, (178), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 13:22:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 230 transitions. [2024-11-22 13:22:13,505 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 230 transitions. Word has length 127 [2024-11-22 13:22:13,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:13,506 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 230 transitions. [2024-11-22 13:22:13,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-22 13:22:13,506 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2024-11-22 13:22:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-22 13:22:13,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:13,508 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:13,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 13:22:13,508 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:13,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:13,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1976651986, now seen corresponding path program 1 times [2024-11-22 13:22:13,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:22:13,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350747624] [2024-11-22 13:22:13,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:13,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:22:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 13:22:15,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:22:15,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350747624] [2024-11-22 13:22:15,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350747624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:22:15,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:22:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-22 13:22:15,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196082182] [2024-11-22 13:22:15,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:22:15,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 13:22:15,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:22:15,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 13:22:15,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-22 13:22:15,202 INFO L87 Difference]: Start difference. First operand 166 states and 230 transitions. Second operand has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-22 13:22:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:16,583 INFO L93 Difference]: Finished difference Result 302 states and 413 transitions. [2024-11-22 13:22:16,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 13:22:16,585 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 127 [2024-11-22 13:22:16,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:16,587 INFO L225 Difference]: With dead ends: 302 [2024-11-22 13:22:16,587 INFO L226 Difference]: Without dead ends: 190 [2024-11-22 13:22:16,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2024-11-22 13:22:16,588 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 270 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 13:22:16,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 547 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 13:22:16,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-22 13:22:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 164. [2024-11-22 13:22:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 135 states have (on average 1.2962962962962963) internal successors, (175), 136 states have internal predecessors, (175), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 13:22:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 227 transitions. [2024-11-22 13:22:16,610 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 227 transitions. Word has length 127 [2024-11-22 13:22:16,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:16,610 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 227 transitions. [2024-11-22 13:22:16,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-22 13:22:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 227 transitions. [2024-11-22 13:22:16,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-22 13:22:16,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:16,611 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:16,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 13:22:16,611 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:16,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:16,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1711105474, now seen corresponding path program 1 times [2024-11-22 13:22:16,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:22:16,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656695609] [2024-11-22 13:22:16,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:16,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:22:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 13:22:17,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:22:17,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656695609] [2024-11-22 13:22:17,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656695609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:22:17,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:22:17,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 13:22:17,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842233901] [2024-11-22 13:22:17,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:22:17,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:22:17,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:22:17,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:22:17,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:22:17,332 INFO L87 Difference]: Start difference. First operand 164 states and 227 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:22:17,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:17,758 INFO L93 Difference]: Finished difference Result 274 states and 377 transitions. [2024-11-22 13:22:17,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:22:17,758 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-22 13:22:17,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:17,759 INFO L225 Difference]: With dead ends: 274 [2024-11-22 13:22:17,759 INFO L226 Difference]: Without dead ends: 164 [2024-11-22 13:22:17,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-22 13:22:17,760 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 174 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:22:17,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 410 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:22:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-22 13:22:17,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-22 13:22:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 135 states have (on average 1.288888888888889) internal successors, (174), 136 states have internal predecessors, (174), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 13:22:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 226 transitions. [2024-11-22 13:22:17,778 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 226 transitions. Word has length 127 [2024-11-22 13:22:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:17,779 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 226 transitions. [2024-11-22 13:22:17,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:22:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 226 transitions. [2024-11-22 13:22:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-22 13:22:17,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:17,779 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:17,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 13:22:17,780 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:17,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:17,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1452940036, now seen corresponding path program 1 times [2024-11-22 13:22:17,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:22:17,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548364723] [2024-11-22 13:22:17,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:17,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:22:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-22 13:22:20,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:22:20,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548364723] [2024-11-22 13:22:20,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548364723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:22:20,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:22:20,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-22 13:22:20,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964915160] [2024-11-22 13:22:20,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:22:20,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 13:22:20,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:22:20,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 13:22:20,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-22 13:22:20,015 INFO L87 Difference]: Start difference. First operand 164 states and 226 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-22 13:22:21,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:21,725 INFO L93 Difference]: Finished difference Result 279 states and 381 transitions. [2024-11-22 13:22:21,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 13:22:21,726 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 127 [2024-11-22 13:22:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:21,727 INFO L225 Difference]: With dead ends: 279 [2024-11-22 13:22:21,727 INFO L226 Difference]: Without dead ends: 169 [2024-11-22 13:22:21,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2024-11-22 13:22:21,729 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 246 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 13:22:21,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 532 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 13:22:21,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-22 13:22:21,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2024-11-22 13:22:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 135 states have (on average 1.2814814814814814) internal successors, (173), 136 states have internal predecessors, (173), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 13:22:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 225 transitions. [2024-11-22 13:22:21,748 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 225 transitions. Word has length 127 [2024-11-22 13:22:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:21,748 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 225 transitions. [2024-11-22 13:22:21,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-22 13:22:21,749 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 225 transitions. [2024-11-22 13:22:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-22 13:22:21,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:21,749 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:21,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 13:22:21,749 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:21,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:21,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1454787078, now seen corresponding path program 1 times [2024-11-22 13:22:21,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:22:21,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767748839] [2024-11-22 13:22:21,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:21,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:22:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 13:22:22,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:22:22,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767748839] [2024-11-22 13:22:22,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767748839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:22:22,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:22:22,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 13:22:22,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931046996] [2024-11-22 13:22:22,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:22:22,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 13:22:22,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:22:22,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 13:22:22,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:22:22,856 INFO L87 Difference]: Start difference. First operand 164 states and 225 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:22:23,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:23,164 INFO L93 Difference]: Finished difference Result 169 states and 230 transitions. [2024-11-22 13:22:23,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:22:23,165 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-22 13:22:23,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:23,166 INFO L225 Difference]: With dead ends: 169 [2024-11-22 13:22:23,166 INFO L226 Difference]: Without dead ends: 167 [2024-11-22 13:22:23,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-22 13:22:23,166 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:22:23,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 483 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:22:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-22 13:22:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-22 13:22:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 138 states have (on average 1.2753623188405796) internal successors, (176), 139 states have internal predecessors, (176), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 13:22:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 228 transitions. [2024-11-22 13:22:23,190 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 228 transitions. Word has length 127 [2024-11-22 13:22:23,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:23,190 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 228 transitions. [2024-11-22 13:22:23,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:22:23,190 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 228 transitions. [2024-11-22 13:22:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-22 13:22:23,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:23,191 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:23,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 13:22:23,191 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:23,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:23,192 INFO L85 PathProgramCache]: Analyzing trace with hash 322067326, now seen corresponding path program 1 times [2024-11-22 13:22:23,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:22:23,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230204146] [2024-11-22 13:22:23,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:23,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:22:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 13:22:23,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1618209408] [2024-11-22 13:22:23,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:23,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:22:23,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:22:23,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:22:23,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 13:22:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:22:26,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 13:22:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:22:26,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 13:22:26,932 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 13:22:26,933 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 13:22:26,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 13:22:27,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-22 13:22:27,141 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:22:27,257 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 13:22:27,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:22:27 BoogieIcfgContainer [2024-11-22 13:22:27,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 13:22:27,260 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 13:22:27,260 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 13:22:27,260 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 13:22:27,260 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:21:54" (3/4) ... [2024-11-22 13:22:27,262 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 13:22:27,263 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 13:22:27,263 INFO L158 Benchmark]: Toolchain (without parser) took 33853.88ms. Allocated memory was 138.4MB in the beginning and 866.1MB in the end (delta: 727.7MB). Free memory was 66.5MB in the beginning and 360.7MB in the end (delta: -294.1MB). Peak memory consumption was 435.7MB. Max. memory is 16.1GB. [2024-11-22 13:22:27,263 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:22:27,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.18ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 66.5MB in the beginning and 146.6MB in the end (delta: -80.1MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2024-11-22 13:22:27,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.29ms. Allocated memory is still 176.2MB. Free memory was 146.6MB in the beginning and 142.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:22:27,264 INFO L158 Benchmark]: Boogie Preprocessor took 54.01ms. Allocated memory is still 176.2MB. Free memory was 142.4MB in the beginning and 139.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 13:22:27,264 INFO L158 Benchmark]: RCFGBuilder took 681.23ms. Allocated memory is still 176.2MB. Free memory was 139.3MB in the beginning and 102.6MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-22 13:22:27,264 INFO L158 Benchmark]: TraceAbstraction took 32664.38ms. Allocated memory was 176.2MB in the beginning and 866.1MB in the end (delta: 690.0MB). Free memory was 101.5MB in the beginning and 360.7MB in the end (delta: -259.1MB). Peak memory consumption was 430.8MB. Max. memory is 16.1GB. [2024-11-22 13:22:27,264 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 866.1MB. Free memory is still 360.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:22:27,265 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.18ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 66.5MB in the beginning and 146.6MB in the end (delta: -80.1MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.29ms. Allocated memory is still 176.2MB. Free memory was 146.6MB in the beginning and 142.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.01ms. Allocated memory is still 176.2MB. Free memory was 142.4MB in the beginning and 139.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 681.23ms. Allocated memory is still 176.2MB. Free memory was 139.3MB in the beginning and 102.6MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 32664.38ms. Allocated memory was 176.2MB in the beginning and 866.1MB in the end (delta: 690.0MB). Free memory was 101.5MB in the beginning and 360.7MB in the end (delta: -259.1MB). Peak memory consumption was 430.8MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 866.1MB. Free memory is still 360.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryArithmeticFLOAToperation at line 93. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L57] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L59] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L60] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L61] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L62] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L63] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L64] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L65] float* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L66] float* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L67] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L68] float* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L69] signed long int* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L70] unsigned char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L71] unsigned char* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=0] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] FCALL updateLastVariables() [L137] CALL updateVariables() [L102] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L105] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L108] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L111] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L114] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_13 [L115] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_13 [L115] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L116] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L117] EXPR WrapperStruct00.var_1_14 [L117] EXPR WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_14 [L117] EXPR WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L117] EXPR (WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L118] WrapperStruct00.var_1_15 = __VERIFIER_nondet_float() [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L119] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L119] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L120] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L121] EXPR WrapperStruct00.var_1_16 [L121] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L121] EXPR WrapperStruct00.var_1_16 [L121] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L121] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L121] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L121] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L122] WrapperStruct00.var_1_20 = __VERIFIER_nondet_uchar() [L123] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L124] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L137] RET updateVariables() [L138] CALL step() [L75] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L75] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L76] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L76] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_20_Pointer)) [L77] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L77] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L78] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_19_Pointer)); [L79] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L79] signed long int stepLocal_0 = ((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))); [L80] COND FALSE !(stepLocal_0 >= 1u) [L87] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L87] (*(WrapperStruct00_var_1_8_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L89] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_8_Pointer)); [L90] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1, stepLocal_1=321, stepLocal_2=65] [L90] COND FALSE !((*(WrapperStruct00_var_1_19_Pointer)) > stepLocal_2) [L93] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L93] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) [L95] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L95] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1, stepLocal_1=321] [L95] COND FALSE !((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) [L98] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L98] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) [L129] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L129] EXPR ((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) [L129] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) [L129] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L129] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))))) [L129] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) [L129] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L129] EXPR ((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR (((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer)))) [L129] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L129] EXPR (((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR (((((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_20_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129-L130] return (((((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_20_Pointer)))) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.5s, OverallIterations: 16, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2742 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2739 mSDsluCounter, 7118 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5467 mSDsCounter, 324 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5119 IncrementalHoareTripleChecker+Invalid, 5443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 324 mSolverCounterUnsat, 1651 mSDtfsCounter, 5119 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=15, InterpolantAutomatonStates: 134, 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, 15 MinimizatonAttempts, 173 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 2252 NumberOfCodeBlocks, 2252 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1982 ConstructedInterpolants, 0 QuantifiedInterpolants, 27346 SizeOfPredicates, 0 NumberOfNonLiveVariables, 536 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 5798/5824 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-22 13:22:27,319 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.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 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:22:29,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:22:29,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 13:22:29,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:22:29,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:22:29,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:22:29,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:22:29,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:22:29,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:22:29,234 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:22:29,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:22:29,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:22:29,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:22:29,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:22:29,236 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:22:29,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:22:29,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:22:29,238 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:22:29,239 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:22:29,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:22:29,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:22:29,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:22:29,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:22:29,242 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 13:22:29,242 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 13:22:29,242 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:22:29,243 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 13:22:29,243 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:22:29,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:22:29,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:22:29,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:22:29,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:22:29,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:22:29,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:22:29,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:22:29,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:22:29,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:22:29,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:22:29,245 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 13:22:29,247 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 13:22:29,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:22:29,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:22:29,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:22:29,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:22:29,248 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 -> 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 [2024-11-22 13:22:29,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:22:29,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:22:29,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:22:29,548 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:22:29,549 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:22:29,550 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-8.i [2024-11-22 13:22:30,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:22:31,038 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:22:31,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-22 13:22:31,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7f470479/09a9659eeb0640948eb357329c8fda70/FLAG7e981be42 [2024-11-22 13:22:31,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7f470479/09a9659eeb0640948eb357329c8fda70 [2024-11-22 13:22:31,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:22:31,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:22:31,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:22:31,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:22:31,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:22:31,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:22:31" (1/1) ... [2024-11-22 13:22:31,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd1e752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:31, skipping insertion in model container [2024-11-22 13:22:31,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:22:31" (1/1) ... [2024-11-22 13:22:31,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:22:31,268 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-8.i[916,929] [2024-11-22 13:22:31,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:22:31,353 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:22:31,363 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-8.i[916,929] [2024-11-22 13:22:31,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:22:31,428 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:22:31,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:31 WrapperNode [2024-11-22 13:22:31,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:22:31,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:22:31,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:22:31,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:22:31,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:31" (1/1) ... [2024-11-22 13:22:31,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:31" (1/1) ... [2024-11-22 13:22:31,491 INFO L138 Inliner]: procedures = 34, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2024-11-22 13:22:31,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:22:31,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:22:31,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:22:31,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:22:31,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:31" (1/1) ... [2024-11-22 13:22:31,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:31" (1/1) ... [2024-11-22 13:22:31,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:31" (1/1) ... [2024-11-22 13:22:31,525 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2024-11-22 13:22:31,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:31" (1/1) ... [2024-11-22 13:22:31,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:31" (1/1) ... [2024-11-22 13:22:31,536 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:31" (1/1) ... [2024-11-22 13:22:31,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:31" (1/1) ... [2024-11-22 13:22:31,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:31" (1/1) ... [2024-11-22 13:22:31,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:31" (1/1) ... [2024-11-22 13:22:31,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:22:31,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:22:31,552 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:22:31,552 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:22:31,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:31" (1/1) ... [2024-11-22 13:22:31,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:22:31,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:22:31,583 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-22 13:22:31,586 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-22 13:22:31,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:22:31,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 13:22:31,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 13:22:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 13:22:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 13:22:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-22 13:22:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-22 13:22:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 13:22:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 13:22:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-22 13:22:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-22 13:22:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-22 13:22:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-22 13:22:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-22 13:22:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-22 13:22:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:22:31,620 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:22:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-22 13:22:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-22 13:22:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:22:31,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:22:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 13:22:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 13:22:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 13:22:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 13:22:31,730 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:22:31,732 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:22:33,940 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-22 13:22:33,941 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:22:33,954 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:22:33,954 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:22:33,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:22:33 BoogieIcfgContainer [2024-11-22 13:22:33,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:22:33,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:22:33,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:22:33,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:22:33,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:22:31" (1/3) ... [2024-11-22 13:22:33,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610fd128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:22:33, skipping insertion in model container [2024-11-22 13:22:33,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:31" (2/3) ... [2024-11-22 13:22:33,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610fd128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:22:33, skipping insertion in model container [2024-11-22 13:22:33,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:22:33" (3/3) ... [2024-11-22 13:22:33,960 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-22 13:22:33,973 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:22:33,973 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:22:34,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:22:34,031 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;@31e9765d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:22:34,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:22:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:22:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 13:22:34,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:34,048 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:34,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:34,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:34,055 INFO L85 PathProgramCache]: Analyzing trace with hash 519972969, now seen corresponding path program 1 times [2024-11-22 13:22:34,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:22:34,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032982651] [2024-11-22 13:22:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:34,068 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-22 13:22:34,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:22:34,071 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-22 13:22:34,072 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-22 13:22:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:34,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 13:22:34,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:22:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-22 13:22:34,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:22:34,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:22:34,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032982651] [2024-11-22 13:22:34,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032982651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:22:34,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:22:34,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:22:34,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561535481] [2024-11-22 13:22:34,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:22:34,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:22:34,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:22:34,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:22:34,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:22:34,555 INFO L87 Difference]: Start difference. First operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 13:22:34,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:34,579 INFO L93 Difference]: Finished difference Result 193 states and 298 transitions. [2024-11-22 13:22:34,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:22:34,583 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-22 13:22:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:34,588 INFO L225 Difference]: With dead ends: 193 [2024-11-22 13:22:34,588 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 13:22:34,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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-22 13:22:34,593 INFO L432 NwaCegarLoop]: 138 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, 138 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-22 13:22:34,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:22:34,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 13:22:34,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-22 13:22:34,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:22:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-22 13:22:34,624 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 123 [2024-11-22 13:22:34,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:34,624 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-22 13:22:34,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 13:22:34,624 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-22 13:22:34,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 13:22:34,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:34,628 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:34,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 13:22:34,830 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-22 13:22:34,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:34,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:34,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1195296213, now seen corresponding path program 1 times [2024-11-22 13:22:34,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:22:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319448383] [2024-11-22 13:22:34,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:34,834 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-22 13:22:34,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:22:34,837 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-22 13:22:34,838 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-22 13:22:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:35,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 13:22:35,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:22:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 13:22:35,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:22:35,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:22:35,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319448383] [2024-11-22 13:22:35,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319448383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:22:35,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:22:35,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:22:35,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975697535] [2024-11-22 13:22:35,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:22:35,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:22:35,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:22:35,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:22:35,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:22:35,273 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:22:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:35,349 INFO L93 Difference]: Finished difference Result 194 states and 280 transitions. [2024-11-22 13:22:35,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:22:35,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-22 13:22:35,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:35,352 INFO L225 Difference]: With dead ends: 194 [2024-11-22 13:22:35,352 INFO L226 Difference]: Without dead ends: 101 [2024-11-22 13:22:35,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 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-22 13:22:35,353 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 516 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-22 13:22:35,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 516 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:22:35,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-22 13:22:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-22 13:22:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:22:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-22 13:22:35,363 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 123 [2024-11-22 13:22:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:35,368 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-22 13:22:35,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:22:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-22 13:22:35,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 13:22:35,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:35,372 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:35,385 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-22 13:22:35,572 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-22 13:22:35,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:35,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:35,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1875354583, now seen corresponding path program 1 times [2024-11-22 13:22:35,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:22:35,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27668482] [2024-11-22 13:22:35,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:35,575 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-22 13:22:35,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:22:35,577 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-22 13:22:35,578 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-22 13:22:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:35,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 13:22:35,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:22:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 13:22:35,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:22:35,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:22:35,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27668482] [2024-11-22 13:22:35,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27668482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:22:35,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:22:35,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:22:35,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957882217] [2024-11-22 13:22:35,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:22:35,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:22:35,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:22:35,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:22:35,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:22:35,957 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:22:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:36,010 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2024-11-22 13:22:36,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:22:36,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-22 13:22:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:36,012 INFO L225 Difference]: With dead ends: 200 [2024-11-22 13:22:36,012 INFO L226 Difference]: Without dead ends: 103 [2024-11-22 13:22:36,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 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-22 13:22:36,013 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:22:36,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 635 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:22:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-22 13:22:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-22 13:22:36,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:22:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-11-22 13:22:36,020 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 123 [2024-11-22 13:22:36,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:36,021 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-11-22 13:22:36,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:22:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-11-22 13:22:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 13:22:36,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:36,023 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:36,034 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 (4)] Forceful destruction successful, exit code 0 [2024-11-22 13:22:36,223 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-22 13:22:36,225 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:36,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:36,225 INFO L85 PathProgramCache]: Analyzing trace with hash -644605351, now seen corresponding path program 1 times [2024-11-22 13:22:36,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:22:36,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364196278] [2024-11-22 13:22:36,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:36,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-22 13:22:36,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:22:36,229 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-22 13:22:36,229 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-22 13:22:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:36,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 13:22:36,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:22:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 13:22:36,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:22:36,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:22:36,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364196278] [2024-11-22 13:22:36,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364196278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:22:36,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:22:36,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 13:22:36,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222765712] [2024-11-22 13:22:36,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:22:36,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:22:36,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:22:36,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:22:36,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:22:36,672 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:22:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:36,750 INFO L93 Difference]: Finished difference Result 204 states and 289 transitions. [2024-11-22 13:22:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:22:36,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-22 13:22:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:36,752 INFO L225 Difference]: With dead ends: 204 [2024-11-22 13:22:36,752 INFO L226 Difference]: Without dead ends: 105 [2024-11-22 13:22:36,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:22:36,753 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:22:36,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 755 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:22:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-22 13:22:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-22 13:22:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:22:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2024-11-22 13:22:36,766 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 123 [2024-11-22 13:22:36,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:36,767 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2024-11-22 13:22:36,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 13:22:36,767 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2024-11-22 13:22:36,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 13:22:36,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:36,768 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:36,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 13:22:36,972 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-22 13:22:36,973 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:36,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:36,973 INFO L85 PathProgramCache]: Analyzing trace with hash -642758309, now seen corresponding path program 1 times [2024-11-22 13:22:36,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:22:36,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458710314] [2024-11-22 13:22:36,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:36,974 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-22 13:22:36,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:22:36,976 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-22 13:22:36,977 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-22 13:22:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:37,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 13:22:37,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:22:37,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 43 [2024-11-22 13:22:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-22 13:22:37,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:22:37,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:22:37,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458710314] [2024-11-22 13:22:37,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458710314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:22:37,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:22:37,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:22:37,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786010738] [2024-11-22 13:22:37,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:22:37,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:22:37,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:22:37,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:22:37,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:22:37,554 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 13:22:39,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 13:22:41,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:41,879 INFO L93 Difference]: Finished difference Result 206 states and 290 transitions. [2024-11-22 13:22:41,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:22:41,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-22 13:22:41,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:41,882 INFO L225 Difference]: With dead ends: 206 [2024-11-22 13:22:41,882 INFO L226 Difference]: Without dead ends: 105 [2024-11-22 13:22:41,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:22:41,884 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 100 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:22:41,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 394 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-22 13:22:41,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-22 13:22:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-22 13:22:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:22:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 145 transitions. [2024-11-22 13:22:41,892 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 145 transitions. Word has length 123 [2024-11-22 13:22:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:41,892 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 145 transitions. [2024-11-22 13:22:41,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 13:22:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 145 transitions. [2024-11-22 13:22:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-22 13:22:41,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:41,893 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:41,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 13:22:42,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:22:42,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:42,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1841218527, now seen corresponding path program 1 times [2024-11-22 13:22:42,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:22:42,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166157025] [2024-11-22 13:22:42,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:42,096 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-22 13:22:42,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:22:42,101 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:22:42,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 13:22:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:42,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 13:22:42,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:22:42,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-22 13:22:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-22 13:22:42,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:22:42,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:22:42,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166157025] [2024-11-22 13:22:42,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166157025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:22:42,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:22:42,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:22:42,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231611142] [2024-11-22 13:22:42,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:22:42,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:22:42,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:22:42,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:22:42,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:22:42,672 INFO L87 Difference]: Start difference. First operand 104 states and 145 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 13:22:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:46,281 INFO L93 Difference]: Finished difference Result 206 states and 288 transitions. [2024-11-22 13:22:46,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:22:46,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-22 13:22:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:46,283 INFO L225 Difference]: With dead ends: 206 [2024-11-22 13:22:46,283 INFO L226 Difference]: Without dead ends: 105 [2024-11-22 13:22:46,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:22:46,284 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 90 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-22 13:22:46,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 389 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-22 13:22:46,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-22 13:22:46,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-22 13:22:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:22:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 144 transitions. [2024-11-22 13:22:46,291 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 144 transitions. Word has length 125 [2024-11-22 13:22:46,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:46,292 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 144 transitions. [2024-11-22 13:22:46,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 13:22:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 144 transitions. [2024-11-22 13:22:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-22 13:22:46,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:46,293 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:46,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 13:22:46,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:22:46,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:46,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:46,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1289197797, now seen corresponding path program 1 times [2024-11-22 13:22:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:22:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875592763] [2024-11-22 13:22:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:46,498 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-22 13:22:46,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:22:46,499 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:22:46,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 13:22:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:46,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 13:22:46,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:22:46,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-22 13:22:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-22 13:22:46,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:22:46,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:22:46,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875592763] [2024-11-22 13:22:46,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875592763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:22:46,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:22:46,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:22:46,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650163521] [2024-11-22 13:22:46,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:22:46,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:22:46,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:22:46,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:22:46,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:22:46,978 INFO L87 Difference]: Start difference. First operand 104 states and 144 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 13:22:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:22:49,401 INFO L93 Difference]: Finished difference Result 206 states and 286 transitions. [2024-11-22 13:22:49,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:22:49,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2024-11-22 13:22:49,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:22:49,402 INFO L225 Difference]: With dead ends: 206 [2024-11-22 13:22:49,402 INFO L226 Difference]: Without dead ends: 105 [2024-11-22 13:22:49,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:22:49,403 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 82 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-22 13:22:49,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 385 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-22 13:22:49,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-22 13:22:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-22 13:22:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 13:22:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2024-11-22 13:22:49,408 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 127 [2024-11-22 13:22:49,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:22:49,408 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2024-11-22 13:22:49,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 13:22:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2024-11-22 13:22:49,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-22 13:22:49,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:22:49,409 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:22:49,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-22 13:22:49,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:22:49,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:22:49,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:22:49,610 INFO L85 PathProgramCache]: Analyzing trace with hash -705934367, now seen corresponding path program 1 times [2024-11-22 13:22:49,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:22:49,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760757417] [2024-11-22 13:22:49,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:22:49,611 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-22 13:22:49,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:22:49,612 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:22:49,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 13:22:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:22:50,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-22 13:22:50,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:22:52,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 13:22:53,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-22 13:22:54,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-22 13:22:55,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-22 13:22:55,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-22 13:22:56,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2024-11-22 13:22:57,763 INFO L349 Elim1Store]: treesize reduction 190, result has 23.7 percent of original size [2024-11-22 13:22:57,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 111 treesize of output 203 [2024-11-22 13:22:57,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2024-11-22 13:22:58,322 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 65 treesize of output 47 [2024-11-22 13:22:58,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2024-11-22 13:22:58,584 INFO L349 Elim1Store]: treesize reduction 96, result has 41.8 percent of original size [2024-11-22 13:22:58,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 147 treesize of output 187 [2024-11-22 13:23:00,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2024-11-22 13:23:00,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2024-11-22 13:23:00,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2024-11-22 13:23:00,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2024-11-22 13:23:00,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2024-11-22 13:23:00,403 INFO L349 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2024-11-22 13:23:00,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 63 [2024-11-22 13:23:00,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2024-11-22 13:23:00,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2024-11-22 13:23:06,650 INFO L349 Elim1Store]: treesize reduction 1691, result has 16.1 percent of original size [2024-11-22 13:23:06,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 209 case distinctions, treesize of input 1117 treesize of output 1135