./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.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_fillercode_fillercodestructure_filler-ps-co_file-97.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 50d5d35851cc8e5f5376c9c4d834d542e4edd508da7d290798477fa80ae9c511 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 09:40:59,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 09:40:59,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 09:40:59,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 09:40:59,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 09:40:59,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 09:40:59,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 09:40:59,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 09:40:59,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 09:40:59,365 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 09:40:59,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 09:40:59,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 09:40:59,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 09:40:59,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 09:40:59,366 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 09:40:59,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 09:40:59,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 09:40:59,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 09:40:59,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 09:40:59,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 09:40:59,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 09:40:59,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 09:40:59,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 09:40:59,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 09:40:59,369 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 09:40:59,369 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 09:40:59,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 09:40:59,370 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 09:40:59,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 09:40:59,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 09:40:59,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 09:40:59,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 09:40:59,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 09:40:59,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 09:40:59,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 09:40:59,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 09:40:59,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 09:40:59,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 09:40:59,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 09:40:59,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 09:40:59,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 09:40:59,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 09:40:59,374 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 50d5d35851cc8e5f5376c9c4d834d542e4edd508da7d290798477fa80ae9c511 [2024-11-22 09:40:59,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 09:40:59,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 09:40:59,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 09:40:59,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 09:40:59,600 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 09:40:59,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2024-11-22 09:41:00,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 09:41:01,012 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 09:41:01,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2024-11-22 09:41:01,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b55e4000/d6311740e4eb4f0aac916c9dacf05848/FLAGd82836fc4 [2024-11-22 09:41:01,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b55e4000/d6311740e4eb4f0aac916c9dacf05848 [2024-11-22 09:41:01,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 09:41:01,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 09:41:01,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 09:41:01,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 09:41:01,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 09:41:01,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:01" (1/1) ... [2024-11-22 09:41:01,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec6c485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:01, skipping insertion in model container [2024-11-22 09:41:01,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:01" (1/1) ... [2024-11-22 09:41:01,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 09:41:01,585 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_fillercode_fillercodestructure_filler-ps-co_file-97.i[919,932] [2024-11-22 09:41:01,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 09:41:01,704 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 09:41:01,715 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_fillercode_fillercodestructure_filler-ps-co_file-97.i[919,932] [2024-11-22 09:41:01,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 09:41:01,770 INFO L204 MainTranslator]: Completed translation [2024-11-22 09:41:01,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:01 WrapperNode [2024-11-22 09:41:01,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 09:41:01,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 09:41:01,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 09:41:01,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 09:41:01,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:01" (1/1) ... [2024-11-22 09:41:01,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:01" (1/1) ... [2024-11-22 09:41:01,824 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 296 [2024-11-22 09:41:01,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 09:41:01,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 09:41:01,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 09:41:01,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 09:41:01,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:01" (1/1) ... [2024-11-22 09:41:01,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:01" (1/1) ... [2024-11-22 09:41:01,838 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:01" (1/1) ... [2024-11-22 09:41:01,858 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 09:41:01,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:01" (1/1) ... [2024-11-22 09:41:01,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:01" (1/1) ... [2024-11-22 09:41:01,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:01" (1/1) ... [2024-11-22 09:41:01,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:01" (1/1) ... [2024-11-22 09:41:01,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:01" (1/1) ... [2024-11-22 09:41:01,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:01" (1/1) ... [2024-11-22 09:41:01,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 09:41:01,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 09:41:01,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 09:41:01,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 09:41:01,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:01" (1/1) ... [2024-11-22 09:41:01,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 09:41:01,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:41:01,928 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 09:41:01,931 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 09:41:01,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 09:41:01,972 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 09:41:01,973 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 09:41:01,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 09:41:01,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 09:41:01,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 09:41:02,064 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 09:41:02,066 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 09:41:02,486 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-22 09:41:02,487 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 09:41:02,504 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 09:41:02,504 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 09:41:02,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:02 BoogieIcfgContainer [2024-11-22 09:41:02,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 09:41:02,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 09:41:02,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 09:41:02,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 09:41:02,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:41:01" (1/3) ... [2024-11-22 09:41:02,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14170704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:41:02, skipping insertion in model container [2024-11-22 09:41:02,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:01" (2/3) ... [2024-11-22 09:41:02,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14170704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:41:02, skipping insertion in model container [2024-11-22 09:41:02,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:02" (3/3) ... [2024-11-22 09:41:02,512 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2024-11-22 09:41:02,524 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 09:41:02,524 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 09:41:02,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 09:41:02,578 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;@3e1407e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 09:41:02,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 09:41:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 90 states have (on average 1.4777777777777779) internal successors, (133), 91 states have internal predecessors, (133), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-22 09:41:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-22 09:41:02,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:02,594 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:02,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:02,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:02,598 INFO L85 PathProgramCache]: Analyzing trace with hash -61352157, now seen corresponding path program 1 times [2024-11-22 09:41:02,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:41:02,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467943849] [2024-11-22 09:41:02,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:02,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:41:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2024-11-22 09:41:02,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:41:02,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467943849] [2024-11-22 09:41:02,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467943849] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 09:41:02,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166670740] [2024-11-22 09:41:02,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:02,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:41:02,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:41:02,922 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 09:41:02,923 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 09:41:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:03,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 09:41:03,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:41:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2024-11-22 09:41:03,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 09:41:03,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166670740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:41:03,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 09:41:03,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 09:41:03,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072750003] [2024-11-22 09:41:03,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:41:03,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 09:41:03,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:41:03,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 09:41:03,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 09:41:03,152 INFO L87 Difference]: Start difference. First operand has 126 states, 90 states have (on average 1.4777777777777779) internal successors, (133), 91 states have internal predecessors, (133), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-22 09:41:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:41:03,202 INFO L93 Difference]: Finished difference Result 244 states and 424 transitions. [2024-11-22 09:41:03,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 09:41:03,204 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 212 [2024-11-22 09:41:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:41:03,212 INFO L225 Difference]: With dead ends: 244 [2024-11-22 09:41:03,213 INFO L226 Difference]: Without dead ends: 121 [2024-11-22 09:41:03,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 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 09:41:03,218 INFO L432 NwaCegarLoop]: 188 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, 188 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 09:41:03,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 09:41:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-22 09:41:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-22 09:41:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-22 09:41:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 188 transitions. [2024-11-22 09:41:03,295 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 188 transitions. Word has length 212 [2024-11-22 09:41:03,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:41:03,296 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 188 transitions. [2024-11-22 09:41:03,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-22 09:41:03,296 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 188 transitions. [2024-11-22 09:41:03,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-22 09:41:03,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:03,301 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:03,310 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 09:41:03,502 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 09:41:03,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:03,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:03,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1105090319, now seen corresponding path program 1 times [2024-11-22 09:41:03,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:41:03,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802971179] [2024-11-22 09:41:03,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:41:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-22 09:41:03,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:41:03,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802971179] [2024-11-22 09:41:03,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802971179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:41:03,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:41:03,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 09:41:03,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169825823] [2024-11-22 09:41:03,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:41:03,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 09:41:03,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:41:03,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 09:41:03,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:41:03,696 INFO L87 Difference]: Start difference. First operand 121 states and 188 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:03,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:41:03,786 INFO L93 Difference]: Finished difference Result 342 states and 533 transitions. [2024-11-22 09:41:03,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 09:41:03,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2024-11-22 09:41:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:41:03,790 INFO L225 Difference]: With dead ends: 342 [2024-11-22 09:41:03,792 INFO L226 Difference]: Without dead ends: 224 [2024-11-22 09:41:03,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:41:03,795 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 152 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 09:41:03,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 344 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 09:41:03,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-22 09:41:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 208. [2024-11-22 09:41:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 139 states have internal predecessors, (186), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-22 09:41:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 318 transitions. [2024-11-22 09:41:03,829 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 318 transitions. Word has length 212 [2024-11-22 09:41:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:41:03,830 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 318 transitions. [2024-11-22 09:41:03,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 318 transitions. [2024-11-22 09:41:03,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-22 09:41:03,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:03,834 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:03,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 09:41:03,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:03,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash -682388493, now seen corresponding path program 1 times [2024-11-22 09:41:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:41:03,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936239427] [2024-11-22 09:41:03,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:03,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:41:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-22 09:41:03,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:41:03,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936239427] [2024-11-22 09:41:03,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936239427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:41:03,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:41:03,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 09:41:03,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890789971] [2024-11-22 09:41:03,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:41:03,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 09:41:03,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:41:03,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 09:41:03,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:41:03,969 INFO L87 Difference]: Start difference. First operand 208 states and 318 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:04,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:41:04,034 INFO L93 Difference]: Finished difference Result 429 states and 657 transitions. [2024-11-22 09:41:04,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 09:41:04,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2024-11-22 09:41:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:41:04,038 INFO L225 Difference]: With dead ends: 429 [2024-11-22 09:41:04,038 INFO L226 Difference]: Without dead ends: 224 [2024-11-22 09:41:04,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:41:04,043 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 174 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 09:41:04,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 468 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 09:41:04,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-22 09:41:04,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 208. [2024-11-22 09:41:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 139 states have (on average 1.2877697841726619) internal successors, (179), 139 states have internal predecessors, (179), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-22 09:41:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 311 transitions. [2024-11-22 09:41:04,065 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 311 transitions. Word has length 212 [2024-11-22 09:41:04,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:41:04,069 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 311 transitions. [2024-11-22 09:41:04,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 311 transitions. [2024-11-22 09:41:04,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-22 09:41:04,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:04,071 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:04,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 09:41:04,071 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:04,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:04,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1962252171, now seen corresponding path program 1 times [2024-11-22 09:41:04,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:41:04,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970302265] [2024-11-22 09:41:04,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:04,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:41:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-22 09:41:04,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:41:04,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970302265] [2024-11-22 09:41:04,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970302265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:41:04,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:41:04,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 09:41:04,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540234991] [2024-11-22 09:41:04,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:41:04,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 09:41:04,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:41:04,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 09:41:04,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 09:41:04,423 INFO L87 Difference]: Start difference. First operand 208 states and 311 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:04,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:41:04,800 INFO L93 Difference]: Finished difference Result 592 states and 892 transitions. [2024-11-22 09:41:04,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 09:41:04,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2024-11-22 09:41:04,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:41:04,804 INFO L225 Difference]: With dead ends: 592 [2024-11-22 09:41:04,804 INFO L226 Difference]: Without dead ends: 387 [2024-11-22 09:41:04,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-22 09:41:04,805 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 237 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 09:41:04,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 598 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 09:41:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-22 09:41:04,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 310. [2024-11-22 09:41:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 207 states have (on average 1.285024154589372) internal successors, (266), 207 states have internal predecessors, (266), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-22 09:41:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 464 transitions. [2024-11-22 09:41:04,838 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 464 transitions. Word has length 212 [2024-11-22 09:41:04,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:41:04,839 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 464 transitions. [2024-11-22 09:41:04,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 464 transitions. [2024-11-22 09:41:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-22 09:41:04,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:04,841 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:04,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 09:41:04,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:04,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1477823945, now seen corresponding path program 1 times [2024-11-22 09:41:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:41:04,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563344730] [2024-11-22 09:41:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:04,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:41:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:05,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-22 09:41:05,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:41:05,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563344730] [2024-11-22 09:41:05,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563344730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:41:05,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:41:05,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 09:41:05,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354403443] [2024-11-22 09:41:05,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:41:05,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 09:41:05,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:41:05,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 09:41:05,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 09:41:05,392 INFO L87 Difference]: Start difference. First operand 310 states and 464 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:05,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:41:05,793 INFO L93 Difference]: Finished difference Result 738 states and 1099 transitions. [2024-11-22 09:41:05,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 09:41:05,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2024-11-22 09:41:05,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:41:05,797 INFO L225 Difference]: With dead ends: 738 [2024-11-22 09:41:05,797 INFO L226 Difference]: Without dead ends: 431 [2024-11-22 09:41:05,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-22 09:41:05,798 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 246 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 09:41:05,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 612 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 09:41:05,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-22 09:41:05,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 415. [2024-11-22 09:41:05,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 278 states have (on average 1.2697841726618706) internal successors, (353), 278 states have internal predecessors, (353), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-22 09:41:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 617 transitions. [2024-11-22 09:41:05,837 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 617 transitions. Word has length 213 [2024-11-22 09:41:05,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:41:05,838 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 617 transitions. [2024-11-22 09:41:05,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:05,838 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 617 transitions. [2024-11-22 09:41:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-22 09:41:05,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:05,841 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:05,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 09:41:05,842 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:05,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:05,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1229641037, now seen corresponding path program 1 times [2024-11-22 09:41:05,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:41:05,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420031375] [2024-11-22 09:41:05,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:05,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:41:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-22 09:41:06,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:41:06,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420031375] [2024-11-22 09:41:06,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420031375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:41:06,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:41:06,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 09:41:06,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962235788] [2024-11-22 09:41:06,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:41:06,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 09:41:06,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:41:06,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 09:41:06,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 09:41:06,097 INFO L87 Difference]: Start difference. First operand 415 states and 617 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:41:06,517 INFO L93 Difference]: Finished difference Result 714 states and 1068 transitions. [2024-11-22 09:41:06,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 09:41:06,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-11-22 09:41:06,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:41:06,522 INFO L225 Difference]: With dead ends: 714 [2024-11-22 09:41:06,522 INFO L226 Difference]: Without dead ends: 509 [2024-11-22 09:41:06,523 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 09:41:06,523 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 294 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 09:41:06,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1013 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 09:41:06,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-22 09:41:06,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 415. [2024-11-22 09:41:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 278 states have (on average 1.2661870503597121) internal successors, (352), 278 states have internal predecessors, (352), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-22 09:41:06,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 616 transitions. [2024-11-22 09:41:06,564 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 616 transitions. Word has length 214 [2024-11-22 09:41:06,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:41:06,564 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 616 transitions. [2024-11-22 09:41:06,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 616 transitions. [2024-11-22 09:41:06,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-22 09:41:06,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:06,566 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:06,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 09:41:06,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:06,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:06,567 INFO L85 PathProgramCache]: Analyzing trace with hash -638217310, now seen corresponding path program 1 times [2024-11-22 09:41:06,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:41:06,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241150778] [2024-11-22 09:41:06,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:06,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:41:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-22 09:41:06,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:41:06,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241150778] [2024-11-22 09:41:06,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241150778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:41:06,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:41:06,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 09:41:06,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137705640] [2024-11-22 09:41:06,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:41:06,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 09:41:06,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:41:06,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 09:41:06,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 09:41:06,917 INFO L87 Difference]: Start difference. First operand 415 states and 616 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:07,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:41:07,049 INFO L93 Difference]: Finished difference Result 902 states and 1345 transitions. [2024-11-22 09:41:07,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 09:41:07,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-11-22 09:41:07,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:41:07,053 INFO L225 Difference]: With dead ends: 902 [2024-11-22 09:41:07,053 INFO L226 Difference]: Without dead ends: 490 [2024-11-22 09:41:07,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 09:41:07,055 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 161 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 09:41:07,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 696 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 09:41:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-22 09:41:07,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 415. [2024-11-22 09:41:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 278 states have (on average 1.2482014388489209) internal successors, (347), 278 states have internal predecessors, (347), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-22 09:41:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 611 transitions. [2024-11-22 09:41:07,113 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 611 transitions. Word has length 214 [2024-11-22 09:41:07,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:41:07,114 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 611 transitions. [2024-11-22 09:41:07,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:07,115 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 611 transitions. [2024-11-22 09:41:07,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-22 09:41:07,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:07,117 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:07,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 09:41:07,118 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:07,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:07,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1632811421, now seen corresponding path program 1 times [2024-11-22 09:41:07,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:41:07,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041485436] [2024-11-22 09:41:07,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:07,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:41:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-22 09:41:07,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:41:07,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041485436] [2024-11-22 09:41:07,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041485436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:41:07,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:41:07,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 09:41:07,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388130613] [2024-11-22 09:41:07,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:41:07,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 09:41:07,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:41:07,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 09:41:07,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:41:07,303 INFO L87 Difference]: Start difference. First operand 415 states and 611 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:07,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:41:07,358 INFO L93 Difference]: Finished difference Result 621 states and 918 transitions. [2024-11-22 09:41:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 09:41:07,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2024-11-22 09:41:07,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:41:07,362 INFO L225 Difference]: With dead ends: 621 [2024-11-22 09:41:07,362 INFO L226 Difference]: Without dead ends: 416 [2024-11-22 09:41:07,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:41:07,363 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 09:41:07,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 366 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 09:41:07,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-22 09:41:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-11-22 09:41:07,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 279 states have (on average 1.2473118279569892) internal successors, (348), 279 states have internal predecessors, (348), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-22 09:41:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 612 transitions. [2024-11-22 09:41:07,424 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 612 transitions. Word has length 218 [2024-11-22 09:41:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:41:07,425 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 612 transitions. [2024-11-22 09:41:07,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:07,425 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 612 transitions. [2024-11-22 09:41:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-22 09:41:07,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:07,427 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:07,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 09:41:07,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:07,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:07,428 INFO L85 PathProgramCache]: Analyzing trace with hash 44463519, now seen corresponding path program 1 times [2024-11-22 09:41:07,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:41:07,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655391685] [2024-11-22 09:41:07,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:07,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:41:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-22 09:41:07,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:41:07,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655391685] [2024-11-22 09:41:07,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655391685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:41:07,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:41:07,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 09:41:07,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128159426] [2024-11-22 09:41:07,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:41:07,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 09:41:07,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:41:07,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 09:41:07,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 09:41:07,665 INFO L87 Difference]: Start difference. First operand 416 states and 612 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:41:08,283 INFO L93 Difference]: Finished difference Result 1118 states and 1626 transitions. [2024-11-22 09:41:08,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 09:41:08,284 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2024-11-22 09:41:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:41:08,290 INFO L225 Difference]: With dead ends: 1118 [2024-11-22 09:41:08,290 INFO L226 Difference]: Without dead ends: 912 [2024-11-22 09:41:08,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 09:41:08,292 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 401 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 09:41:08,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 741 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 09:41:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2024-11-22 09:41:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 731. [2024-11-22 09:41:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 492 states have (on average 1.2357723577235773) internal successors, (608), 492 states have internal predecessors, (608), 231 states have call successors, (231), 7 states have call predecessors, (231), 7 states have return successors, (231), 231 states have call predecessors, (231), 231 states have call successors, (231) [2024-11-22 09:41:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1070 transitions. [2024-11-22 09:41:08,401 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1070 transitions. Word has length 218 [2024-11-22 09:41:08,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:41:08,402 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1070 transitions. [2024-11-22 09:41:08,402 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:08,402 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1070 transitions. [2024-11-22 09:41:08,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-22 09:41:08,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:08,404 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:08,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 09:41:08,404 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:08,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:08,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1049602151, now seen corresponding path program 1 times [2024-11-22 09:41:08,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:41:08,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674765940] [2024-11-22 09:41:08,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:41:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-22 09:41:13,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:41:13,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674765940] [2024-11-22 09:41:13,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674765940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:41:13,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:41:13,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 09:41:13,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579907273] [2024-11-22 09:41:13,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:41:13,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 09:41:13,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:41:13,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 09:41:13,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-22 09:41:13,859 INFO L87 Difference]: Start difference. First operand 731 states and 1070 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:41:15,600 INFO L93 Difference]: Finished difference Result 1361 states and 1921 transitions. [2024-11-22 09:41:15,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 09:41:15,601 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2024-11-22 09:41:15,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:41:15,605 INFO L225 Difference]: With dead ends: 1361 [2024-11-22 09:41:15,605 INFO L226 Difference]: Without dead ends: 1053 [2024-11-22 09:41:15,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-22 09:41:15,607 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 242 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 09:41:15,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 673 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 09:41:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-11-22 09:41:15,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1005. [2024-11-22 09:41:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 748 states have (on average 1.2339572192513368) internal successors, (923), 754 states have internal predecessors, (923), 243 states have call successors, (243), 13 states have call predecessors, (243), 13 states have return successors, (243), 237 states have call predecessors, (243), 243 states have call successors, (243) [2024-11-22 09:41:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1409 transitions. [2024-11-22 09:41:15,721 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1409 transitions. Word has length 218 [2024-11-22 09:41:15,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:41:15,721 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1409 transitions. [2024-11-22 09:41:15,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:15,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1409 transitions. [2024-11-22 09:41:15,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-22 09:41:15,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:15,723 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:15,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 09:41:15,724 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:15,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:15,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1439926811, now seen corresponding path program 1 times [2024-11-22 09:41:15,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:41:15,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018521929] [2024-11-22 09:41:15,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:15,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:41:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 09:41:15,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [746832654] [2024-11-22 09:41:15,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:15,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:41:15,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:41:15,798 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 09:41:15,798 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 09:41:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 09:41:15,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 09:41:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 09:41:16,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 09:41:16,084 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 09:41:16,084 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 09:41:16,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 09:41:16,287 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,SelfDestructingSolverStorable10 [2024-11-22 09:41:16,292 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:41:16,400 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 09:41:16,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:41:16 BoogieIcfgContainer [2024-11-22 09:41:16,403 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 09:41:16,404 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 09:41:16,404 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 09:41:16,404 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 09:41:16,404 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:02" (3/4) ... [2024-11-22 09:41:16,406 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 09:41:16,407 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 09:41:16,407 INFO L158 Benchmark]: Toolchain (without parser) took 14994.56ms. Allocated memory was 155.2MB in the beginning and 566.2MB in the end (delta: 411.0MB). Free memory was 85.2MB in the beginning and 362.2MB in the end (delta: -277.0MB). Peak memory consumption was 135.2MB. Max. memory is 16.1GB. [2024-11-22 09:41:16,408 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory was 106.1MB in the beginning and 106.0MB in the end (delta: 95.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 09:41:16,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.87ms. Allocated memory was 155.2MB in the beginning and 209.7MB in the end (delta: 54.5MB). Free memory was 85.0MB in the beginning and 178.1MB in the end (delta: -93.1MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-22 09:41:16,408 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.46ms. Allocated memory is still 209.7MB. Free memory was 178.1MB in the beginning and 171.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 09:41:16,409 INFO L158 Benchmark]: Boogie Preprocessor took 72.75ms. Allocated memory is still 209.7MB. Free memory was 171.8MB in the beginning and 163.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-22 09:41:16,409 INFO L158 Benchmark]: RCFGBuilder took 605.74ms. Allocated memory is still 209.7MB. Free memory was 163.4MB in the beginning and 125.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-22 09:41:16,409 INFO L158 Benchmark]: TraceAbstraction took 13897.11ms. Allocated memory was 209.7MB in the beginning and 566.2MB in the end (delta: 356.5MB). Free memory was 125.7MB in the beginning and 363.3MB in the end (delta: -237.6MB). Peak memory consumption was 118.9MB. Max. memory is 16.1GB. [2024-11-22 09:41:16,410 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 566.2MB. Free memory was 363.3MB in the beginning and 362.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 09:41:16,411 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 155.2MB. Free memory was 106.1MB in the beginning and 106.0MB in the end (delta: 95.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.87ms. Allocated memory was 155.2MB in the beginning and 209.7MB in the end (delta: 54.5MB). Free memory was 85.0MB in the beginning and 178.1MB in the end (delta: -93.1MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.46ms. Allocated memory is still 209.7MB. Free memory was 178.1MB in the beginning and 171.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.75ms. Allocated memory is still 209.7MB. Free memory was 171.8MB in the beginning and 163.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 605.74ms. Allocated memory is still 209.7MB. Free memory was 163.4MB in the beginning and 125.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13897.11ms. Allocated memory was 209.7MB in the beginning and 566.2MB in the end (delta: 356.5MB). Free memory was 125.7MB in the beginning and 363.3MB in the end (delta: -237.6MB). Peak memory consumption was 118.9MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 566.2MB. Free memory was 363.3MB in the beginning and 362.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someUnaryDOUBLEoperation at line 48. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] signed char var_1_27 = 64; [L41] unsigned short int var_1_29 = 8; [L42] unsigned char var_1_30 = 16; [L43] unsigned short int var_1_33 = 48416; [L44] unsigned char var_1_35 = 4; [L45] unsigned char var_1_36 = 25; [L46] unsigned long int var_1_37 = 32; [L47] unsigned char var_1_38 = 8; [L48] double var_1_39 = -0.75; [L49] double var_1_40 = 31.75; [L50] double var_1_41 = 5.5; [L51] double var_1_42 = 32.5; [L52] signed char var_1_43 = 100; [L53] signed char var_1_44 = 50; [L54] signed char var_1_45 = 5; [L55] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0, var_1_9=643/5] [L205] isInitial = 1 [L206] FCALL initially() [L207] COND TRUE 1 [L208] CALL updateLastVariables() [L198] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0, var_1_9=643/5] [L208] RET updateLastVariables() [L209] CALL updateVariables() [L144] var_1_9 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L146] var_1_10 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L147] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L148] var_1_11 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L149] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L150] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L150] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L151] var_1_12 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L152] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L153] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L153] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L154] var_1_13 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L156] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L156] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L157] var_1_14 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L159] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L160] var_1_18 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L162] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L162] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L163] var_1_19 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L165] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L165] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L166] var_1_23 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L167] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L168] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L169] var_1_27 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L170] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L171] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L171] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L172] var_1_30 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L173] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L174] CALL assume_abort_if_not(var_1_30 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L174] RET assume_abort_if_not(var_1_30 <= 255) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L175] CALL assume_abort_if_not(var_1_30 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L175] RET assume_abort_if_not(var_1_30 != 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L176] var_1_33 = __VERIFIER_nondet_ushort() [L177] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L177] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L178] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L178] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L179] var_1_36 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L180] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L181] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L181] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L182] var_1_39 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L183] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L184] var_1_40 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L185] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L186] var_1_41 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L187] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L188] var_1_42 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L189] RET assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L190] var_1_44 = __VERIFIER_nondet_char() [L191] CALL assume_abort_if_not(var_1_44 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L191] RET assume_abort_if_not(var_1_44 >= -1) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L192] CALL assume_abort_if_not(var_1_44 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L192] RET assume_abort_if_not(var_1_44 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L193] var_1_45 = __VERIFIER_nondet_char() [L194] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L194] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L195] CALL assume_abort_if_not(var_1_45 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L195] RET assume_abort_if_not(var_1_45 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L209] RET updateVariables() [L210] CALL step() [L59] COND FALSE !(\read(var_1_22)) [L64] var_1_24 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L66] COND TRUE (var_1_20 / var_1_30) < var_1_27 [L67] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L71] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L74] COND TRUE ((((var_1_8) < (var_1_1)) ? (var_1_8) : (var_1_1))) >= var_1_15 [L75] var_1_37 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L77] COND FALSE !((var_1_39 * (var_1_40 - var_1_41)) >= var_1_42) [L84] var_1_38 = var_1_36 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L86] COND FALSE !(((((var_1_39) > (64.75f)) ? (var_1_39) : (64.75f))) <= var_1_40) [L93] var_1_43 = var_1_44 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L95] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L98] var_1_20 = var_1_8 [L99] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L100] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L103] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L104] COND FALSE !(\read(var_1_22)) [L111] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L113] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L114] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L115] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L116] COND FALSE !(\read(var_1_22)) [L123] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L128] signed long int stepLocal_4 = 256; [L129] unsigned char stepLocal_3 = var_1_22; [L130] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L131] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L134] COND FALSE !(stepLocal_3 || var_1_22) [L139] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L210] RET step() [L211] CALL, EXPR property() [L201] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201-L202] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L211] RET, EXPR property() [L211] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 11, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1907 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1907 mSDsluCounter, 5699 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3302 mSDsCounter, 554 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1457 IncrementalHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 554 mSolverCounterUnsat, 2397 mSDtfsCounter, 1457 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1005occurred in iteration=10, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 523 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 2791 NumberOfCodeBlocks, 2791 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2344 ConstructedInterpolants, 0 QuantifiedInterpolants, 12020 SizeOfPredicates, 0 NumberOfNonLiveVariables, 482 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 23168/23232 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 09:41:16,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.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 50d5d35851cc8e5f5376c9c4d834d542e4edd508da7d290798477fa80ae9c511 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 09:41:18,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 09:41:18,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 09:41:18,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 09:41:18,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 09:41:18,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 09:41:18,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 09:41:18,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 09:41:18,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 09:41:18,377 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 09:41:18,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 09:41:18,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 09:41:18,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 09:41:18,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 09:41:18,380 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 09:41:18,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 09:41:18,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 09:41:18,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 09:41:18,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 09:41:18,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 09:41:18,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 09:41:18,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 09:41:18,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 09:41:18,384 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 09:41:18,384 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 09:41:18,384 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 09:41:18,385 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 09:41:18,385 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 09:41:18,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 09:41:18,385 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 09:41:18,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 09:41:18,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 09:41:18,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 09:41:18,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 09:41:18,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 09:41:18,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 09:41:18,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 09:41:18,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 09:41:18,387 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 09:41:18,387 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 09:41:18,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 09:41:18,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 09:41:18,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 09:41:18,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 09:41:18,389 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 -> 50d5d35851cc8e5f5376c9c4d834d542e4edd508da7d290798477fa80ae9c511 [2024-11-22 09:41:18,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 09:41:18,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 09:41:18,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 09:41:18,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 09:41:18,662 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 09:41:18,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2024-11-22 09:41:19,936 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 09:41:20,139 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 09:41:20,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2024-11-22 09:41:20,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0735dba91/74e6cf81dedd47be8422b4ee0eb9a391/FLAG1b29a8d73 [2024-11-22 09:41:20,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0735dba91/74e6cf81dedd47be8422b4ee0eb9a391 [2024-11-22 09:41:20,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 09:41:20,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 09:41:20,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 09:41:20,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 09:41:20,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 09:41:20,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:20" (1/1) ... [2024-11-22 09:41:20,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d0ae8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20, skipping insertion in model container [2024-11-22 09:41:20,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:20" (1/1) ... [2024-11-22 09:41:20,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 09:41:20,699 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_fillercode_fillercodestructure_filler-ps-co_file-97.i[919,932] [2024-11-22 09:41:20,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 09:41:20,793 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 09:41:20,804 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_fillercode_fillercodestructure_filler-ps-co_file-97.i[919,932] [2024-11-22 09:41:20,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 09:41:20,865 INFO L204 MainTranslator]: Completed translation [2024-11-22 09:41:20,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20 WrapperNode [2024-11-22 09:41:20,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 09:41:20,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 09:41:20,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 09:41:20,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 09:41:20,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2024-11-22 09:41:20,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2024-11-22 09:41:20,921 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-11-22 09:41:20,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 09:41:20,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 09:41:20,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 09:41:20,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 09:41:20,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2024-11-22 09:41:20,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2024-11-22 09:41:20,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2024-11-22 09:41:20,960 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 09:41:20,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2024-11-22 09:41:20,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2024-11-22 09:41:20,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2024-11-22 09:41:20,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2024-11-22 09:41:20,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2024-11-22 09:41:20,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2024-11-22 09:41:20,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 09:41:21,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 09:41:21,001 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 09:41:21,001 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 09:41:21,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2024-11-22 09:41:21,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 09:41:21,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:41:21,042 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 09:41:21,044 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 09:41:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 09:41:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 09:41:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 09:41:21,085 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 09:41:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 09:41:21,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 09:41:21,180 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 09:41:21,182 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 09:41:29,795 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-22 09:41:29,796 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 09:41:29,808 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 09:41:29,808 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 09:41:29,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:29 BoogieIcfgContainer [2024-11-22 09:41:29,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 09:41:29,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 09:41:29,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 09:41:29,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 09:41:29,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:41:20" (1/3) ... [2024-11-22 09:41:29,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de58ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:41:29, skipping insertion in model container [2024-11-22 09:41:29,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (2/3) ... [2024-11-22 09:41:29,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de58ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:41:29, skipping insertion in model container [2024-11-22 09:41:29,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:29" (3/3) ... [2024-11-22 09:41:29,818 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2024-11-22 09:41:29,832 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 09:41:29,832 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 09:41:29,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 09:41:29,901 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;@6a9b51a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 09:41:29,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 09:41:29,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-22 09:41:29,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-22 09:41:29,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:29,921 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:29,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:29,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:29,928 INFO L85 PathProgramCache]: Analyzing trace with hash 49629536, now seen corresponding path program 1 times [2024-11-22 09:41:29,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 09:41:29,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891276368] [2024-11-22 09:41:29,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:29,945 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 09:41:29,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 09:41:29,948 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 09:41:29,950 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 09:41:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:30,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 09:41:30,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:41:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2024-11-22 09:41:30,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 09:41:30,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 09:41:30,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891276368] [2024-11-22 09:41:30,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891276368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:41:30,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:41:30,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 09:41:30,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827481122] [2024-11-22 09:41:30,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:41:30,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 09:41:30,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 09:41:30,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 09:41:30,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 09:41:30,549 INFO L87 Difference]: Start difference. First operand has 95 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-22 09:41:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:41:30,583 INFO L93 Difference]: Finished difference Result 183 states and 327 transitions. [2024-11-22 09:41:30,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 09:41:30,585 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 208 [2024-11-22 09:41:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:41:30,593 INFO L225 Difference]: With dead ends: 183 [2024-11-22 09:41:30,593 INFO L226 Difference]: Without dead ends: 91 [2024-11-22 09:41:30,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 207 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 09:41:30,603 INFO L432 NwaCegarLoop]: 142 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, 142 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 09:41:30,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 09:41:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-22 09:41:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-22 09:41:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-22 09:41:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2024-11-22 09:41:30,650 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 208 [2024-11-22 09:41:30,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:41:30,651 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2024-11-22 09:41:30,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-22 09:41:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2024-11-22 09:41:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-22 09:41:30,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:30,656 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:30,671 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 09:41:30,856 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 09:41:30,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:30,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:30,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1998336558, now seen corresponding path program 1 times [2024-11-22 09:41:30,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 09:41:30,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214201281] [2024-11-22 09:41:30,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:30,859 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 09:41:30,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 09:41:30,861 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 09:41:30,862 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 09:41:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:31,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 09:41:31,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:41:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-22 09:41:33,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 09:41:33,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 09:41:33,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214201281] [2024-11-22 09:41:33,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214201281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:41:33,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:41:33,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 09:41:33,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178963564] [2024-11-22 09:41:33,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:41:33,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 09:41:33,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 09:41:33,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 09:41:33,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:41:33,143 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:41:33,320 INFO L93 Difference]: Finished difference Result 263 states and 412 transitions. [2024-11-22 09:41:33,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 09:41:33,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-22 09:41:33,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:41:33,323 INFO L225 Difference]: With dead ends: 263 [2024-11-22 09:41:33,323 INFO L226 Difference]: Without dead ends: 175 [2024-11-22 09:41:33,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:41:33,325 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 33 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 09:41:33,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 260 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 09:41:33,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-22 09:41:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 165. [2024-11-22 09:41:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 96 states have internal predecessors, (122), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-22 09:41:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 254 transitions. [2024-11-22 09:41:33,345 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 254 transitions. Word has length 208 [2024-11-22 09:41:33,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:41:33,346 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 254 transitions. [2024-11-22 09:41:33,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:33,346 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 254 transitions. [2024-11-22 09:41:33,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-22 09:41:33,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:33,349 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:33,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-22 09:41:33,549 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 09:41:33,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:33,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:33,554 INFO L85 PathProgramCache]: Analyzing trace with hash 409988656, now seen corresponding path program 1 times [2024-11-22 09:41:33,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 09:41:33,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384467882] [2024-11-22 09:41:33,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:33,555 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 09:41:33,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 09:41:33,557 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 09:41:33,558 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 09:41:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:33,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 09:41:33,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:41:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-22 09:41:35,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 09:41:35,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 09:41:35,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384467882] [2024-11-22 09:41:35,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384467882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:41:35,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:41:35,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 09:41:35,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012961712] [2024-11-22 09:41:35,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:41:35,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 09:41:35,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 09:41:35,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 09:41:35,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:41:35,332 INFO L87 Difference]: Start difference. First operand 165 states and 254 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:41:35,444 INFO L93 Difference]: Finished difference Result 412 states and 634 transitions. [2024-11-22 09:41:35,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 09:41:35,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-22 09:41:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:41:35,448 INFO L225 Difference]: With dead ends: 412 [2024-11-22 09:41:35,448 INFO L226 Difference]: Without dead ends: 250 [2024-11-22 09:41:35,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:41:35,450 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 34 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 09:41:35,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 280 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 09:41:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-22 09:41:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2024-11-22 09:41:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 145 states have (on average 1.2620689655172415) internal successors, (183), 145 states have internal predecessors, (183), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-22 09:41:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 381 transitions. [2024-11-22 09:41:35,479 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 381 transitions. Word has length 208 [2024-11-22 09:41:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:41:35,480 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 381 transitions. [2024-11-22 09:41:35,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:35,480 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 381 transitions. [2024-11-22 09:41:35,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-22 09:41:35,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:35,482 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:35,502 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 09:41:35,683 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 09:41:35,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:35,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:35,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1431057010, now seen corresponding path program 1 times [2024-11-22 09:41:35,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 09:41:35,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723326266] [2024-11-22 09:41:35,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:35,685 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 09:41:35,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 09:41:35,688 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 09:41:35,689 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 09:41:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:36,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 09:41:36,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:41:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1082 proven. 51 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2024-11-22 09:41:36,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 09:41:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 45 proven. 51 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-22 09:41:37,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 09:41:37,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723326266] [2024-11-22 09:41:37,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723326266] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 09:41:37,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 09:41:37,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-22 09:41:37,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509389484] [2024-11-22 09:41:37,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 09:41:37,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 09:41:37,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 09:41:37,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 09:41:37,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-22 09:41:37,314 INFO L87 Difference]: Start difference. First operand 248 states and 381 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-22 09:41:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:41:38,238 INFO L93 Difference]: Finished difference Result 258 states and 389 transitions. [2024-11-22 09:41:38,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 09:41:38,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 208 [2024-11-22 09:41:38,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:41:38,243 INFO L225 Difference]: With dead ends: 258 [2024-11-22 09:41:38,243 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 09:41:38,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-22 09:41:38,246 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 154 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 09:41:38,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 188 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 09:41:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 09:41:38,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-11-22 09:41:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-22 09:41:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 133 transitions. [2024-11-22 09:41:38,264 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 133 transitions. Word has length 208 [2024-11-22 09:41:38,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:41:38,265 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 133 transitions. [2024-11-22 09:41:38,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-22 09:41:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 133 transitions. [2024-11-22 09:41:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-22 09:41:38,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:38,267 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:38,286 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 09:41:38,467 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 09:41:38,468 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:38,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:38,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2132121588, now seen corresponding path program 1 times [2024-11-22 09:41:38,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 09:41:38,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662545759] [2024-11-22 09:41:38,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:38,469 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 09:41:38,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 09:41:38,472 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 09:41:38,473 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 09:41:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:38,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 09:41:38,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:41:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-22 09:41:39,786 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 09:41:39,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 09:41:39,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662545759] [2024-11-22 09:41:39,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662545759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:41:39,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:41:39,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 09:41:39,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240734163] [2024-11-22 09:41:39,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:41:39,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 09:41:39,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 09:41:39,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 09:41:39,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 09:41:39,788 INFO L87 Difference]: Start difference. First operand 92 states and 133 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:41:40,678 INFO L93 Difference]: Finished difference Result 254 states and 373 transitions. [2024-11-22 09:41:40,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 09:41:40,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-22 09:41:40,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:41:40,680 INFO L225 Difference]: With dead ends: 254 [2024-11-22 09:41:40,680 INFO L226 Difference]: Without dead ends: 165 [2024-11-22 09:41:40,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 09:41:40,681 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 131 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 09:41:40,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 473 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 09:41:40,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-22 09:41:40,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 92. [2024-11-22 09:41:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-22 09:41:40,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-11-22 09:41:40,697 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 208 [2024-11-22 09:41:40,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:41:40,698 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-11-22 09:41:40,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:40,698 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-11-22 09:41:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-22 09:41:40,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:40,699 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:40,718 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 09:41:40,902 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 09:41:40,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:40,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:40,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1495602127, now seen corresponding path program 1 times [2024-11-22 09:41:40,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 09:41:40,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921459936] [2024-11-22 09:41:40,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:40,904 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 09:41:40,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 09:41:40,906 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 09:41:40,907 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 09:41:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:41,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 09:41:41,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:41:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-22 09:41:43,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 09:41:43,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 09:41:43,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921459936] [2024-11-22 09:41:43,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921459936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:41:43,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:41:43,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 09:41:43,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27403655] [2024-11-22 09:41:43,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:41:43,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 09:41:43,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 09:41:43,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 09:41:43,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 09:41:43,456 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:41:44,013 INFO L93 Difference]: Finished difference Result 277 states and 397 transitions. [2024-11-22 09:41:44,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 09:41:44,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-22 09:41:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:41:44,015 INFO L225 Difference]: With dead ends: 277 [2024-11-22 09:41:44,015 INFO L226 Difference]: Without dead ends: 188 [2024-11-22 09:41:44,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-22 09:41:44,019 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 79 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 09:41:44,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 413 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 09:41:44,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-22 09:41:44,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 179. [2024-11-22 09:41:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 108 states have (on average 1.1759259259259258) internal successors, (127), 108 states have internal predecessors, (127), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-22 09:41:44,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 259 transitions. [2024-11-22 09:41:44,046 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 259 transitions. Word has length 209 [2024-11-22 09:41:44,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:41:44,047 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 259 transitions. [2024-11-22 09:41:44,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-22 09:41:44,047 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 259 transitions. [2024-11-22 09:41:44,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-22 09:41:44,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:41:44,049 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:44,064 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 09:41:44,249 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 09:41:44,250 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:41:44,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:41:44,250 INFO L85 PathProgramCache]: Analyzing trace with hash 936323251, now seen corresponding path program 1 times [2024-11-22 09:41:44,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 09:41:44,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831449149] [2024-11-22 09:41:44,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:41:44,251 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 09:41:44,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 09:41:44,252 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 09:41:44,253 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 09:41:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:41:44,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 09:41:44,616 INFO L278 TraceCheckSpWp]: Computing forward predicates...