./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-92.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 7e6a9890500b02becbe2374583823016242ae2e1be997dd1bfb050bacebdd67a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:10:43,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:10:43,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:10:43,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:10:43,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:10:43,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:10:43,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:10:43,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:10:43,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:10:43,566 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:10:43,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:10:43,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:10:43,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:10:43,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:10:43,567 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:10:43,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:10:43,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:10:43,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:10:43,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:10:43,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:10:43,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:10:43,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:10:43,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:10:43,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:10:43,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:10:43,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:10:43,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:10:43,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:10:43,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:10:43,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:10:43,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:10:43,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:10:43,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:10:43,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:10:43,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:10:43,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:10:43,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:10:43,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:10:43,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:10:43,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:10:43,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:10:43,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:10:43,578 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 -> 7e6a9890500b02becbe2374583823016242ae2e1be997dd1bfb050bacebdd67a [2024-10-24 06:10:43,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:10:43,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:10:43,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:10:43,829 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:10:43,830 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:10:43,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-92.i [2024-10-24 06:10:45,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:10:45,295 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:10:45,296 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-92.i [2024-10-24 06:10:45,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/669c49cc0/2814cb51fbd14797ad2c20fc5e71c27b/FLAGafa9d173f [2024-10-24 06:10:45,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/669c49cc0/2814cb51fbd14797ad2c20fc5e71c27b [2024-10-24 06:10:45,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:10:45,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:10:45,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:10:45,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:10:45,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:10:45,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:10:45" (1/1) ... [2024-10-24 06:10:45,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a404a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:45, skipping insertion in model container [2024-10-24 06:10:45,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:10:45" (1/1) ... [2024-10-24 06:10:45,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:10:45,493 WARN L248 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_fillercodesize_ps-cn-10_file-92.i[915,928] [2024-10-24 06:10:45,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:10:45,561 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:10:45,570 WARN L248 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_fillercodesize_ps-cn-10_file-92.i[915,928] [2024-10-24 06:10:45,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:10:45,624 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:10:45,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:45 WrapperNode [2024-10-24 06:10:45,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:10:45,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:10:45,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:10:45,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:10:45,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:45" (1/1) ... [2024-10-24 06:10:45,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:45" (1/1) ... [2024-10-24 06:10:45,686 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-10-24 06:10:45,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:10:45,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:10:45,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:10:45,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:10:45,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:45" (1/1) ... [2024-10-24 06:10:45,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:45" (1/1) ... [2024-10-24 06:10:45,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:45" (1/1) ... [2024-10-24 06:10:45,734 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-10-24 06:10:45,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:45" (1/1) ... [2024-10-24 06:10:45,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:45" (1/1) ... [2024-10-24 06:10:45,751 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:45" (1/1) ... [2024-10-24 06:10:45,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:45" (1/1) ... [2024-10-24 06:10:45,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:45" (1/1) ... [2024-10-24 06:10:45,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:45" (1/1) ... [2024-10-24 06:10:45,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:10:45,771 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:10:45,771 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:10:45,771 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:10:45,772 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:45" (1/1) ... [2024-10-24 06:10:45,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:10:45,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:10:45,814 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-10-24 06:10:45,817 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-10-24 06:10:45,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:10:45,874 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:10:45,874 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:10:45,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:10:45,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:10:45,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:10:45,944 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:10:45,946 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:10:46,296 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 06:10:46,296 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:10:46,337 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:10:46,338 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:10:46,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:10:46 BoogieIcfgContainer [2024-10-24 06:10:46,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:10:46,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:10:46,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:10:46,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:10:46,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:10:45" (1/3) ... [2024-10-24 06:10:46,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a0671f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:10:46, skipping insertion in model container [2024-10-24 06:10:46,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:45" (2/3) ... [2024-10-24 06:10:46,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a0671f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:10:46, skipping insertion in model container [2024-10-24 06:10:46,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:10:46" (3/3) ... [2024-10-24 06:10:46,349 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-92.i [2024-10-24 06:10:46,363 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:10:46,364 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:10:46,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:10:46,427 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;@388b6472, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:10:46,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:10:46,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 48 states have (on average 1.4375) internal successors, (69), 49 states have internal predecessors, (69), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 06:10:46,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 06:10:46,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:10:46,449 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:10:46,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:10:46,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:10:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash 897094305, now seen corresponding path program 1 times [2024-10-24 06:10:46,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:10:46,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752612975] [2024-10-24 06:10:46,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:10:46,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:10:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:10:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:10:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:10:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:10:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:10:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:10:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:10:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:10:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:10:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:10:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:10:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:10:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:10:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:10:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 06:10:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:10:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:10:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 06:10:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:10:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 06:10:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:10:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 06:10:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:10:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 06:10:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:10:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 06:10:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 06:10:46,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:10:46,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752612975] [2024-10-24 06:10:46,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752612975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:10:46,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:10:46,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:10:46,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776588570] [2024-10-24 06:10:46,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:10:46,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:10:46,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:10:47,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:10:47,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:10:47,024 INFO L87 Difference]: Start difference. First operand has 77 states, 48 states have (on average 1.4375) internal successors, (69), 49 states have internal predecessors, (69), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 06:10:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:10:47,067 INFO L93 Difference]: Finished difference Result 151 states and 266 transitions. [2024-10-24 06:10:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:10:47,072 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 162 [2024-10-24 06:10:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:10:47,082 INFO L225 Difference]: With dead ends: 151 [2024-10-24 06:10:47,082 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 06:10:47,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-10-24 06:10:47,091 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:10:47,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:10:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 06:10:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-24 06:10:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 06:10:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 116 transitions. [2024-10-24 06:10:47,141 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 116 transitions. Word has length 162 [2024-10-24 06:10:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:10:47,141 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 116 transitions. [2024-10-24 06:10:47,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 06:10:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 116 transitions. [2024-10-24 06:10:47,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 06:10:47,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:10:47,146 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:10:47,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:10:47,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:10:47,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:10:47,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1074068509, now seen corresponding path program 1 times [2024-10-24 06:10:47,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:10:47,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733154586] [2024-10-24 06:10:47,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:10:47,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:10:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:10:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:10:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:10:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:10:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:10:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:10:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:10:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:10:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:10:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:10:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:10:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:10:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:10:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:10:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 06:10:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:10:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:10:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 06:10:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:10:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 06:10:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:10:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 06:10:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:10:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 06:10:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:10:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 06:10:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 06:10:47,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:10:47,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733154586] [2024-10-24 06:10:47,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733154586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:10:47,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:10:47,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:10:47,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754643824] [2024-10-24 06:10:47,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:10:47,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:10:47,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:10:47,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:10:47,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:10:47,607 INFO L87 Difference]: Start difference. First operand 75 states and 116 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 06:10:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:10:47,813 INFO L93 Difference]: Finished difference Result 150 states and 233 transitions. [2024-10-24 06:10:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:10:47,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-10-24 06:10:47,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:10:47,816 INFO L225 Difference]: With dead ends: 150 [2024-10-24 06:10:47,817 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 06:10:47,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 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-10-24 06:10:47,818 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 115 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:10:47,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 158 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:10:47,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 06:10:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-24 06:10:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 06:10:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 117 transitions. [2024-10-24 06:10:47,835 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 117 transitions. Word has length 162 [2024-10-24 06:10:47,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:10:47,838 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 117 transitions. [2024-10-24 06:10:47,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 06:10:47,839 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 117 transitions. [2024-10-24 06:10:47,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 06:10:47,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:10:47,843 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:10:47,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:10:47,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:10:47,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:10:47,844 INFO L85 PathProgramCache]: Analyzing trace with hash 53000155, now seen corresponding path program 1 times [2024-10-24 06:10:47,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:10:47,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411924754] [2024-10-24 06:10:47,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:10:47,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:10:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:10:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:10:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:10:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:10:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:10:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:10:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:10:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:10:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:10:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:10:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:10:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:10:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:10:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:10:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 06:10:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:10:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:10:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 06:10:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:10:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 06:10:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:10:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 06:10:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:10:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 06:10:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:10:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 06:10:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 06:10:48,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:10:48,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411924754] [2024-10-24 06:10:48,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411924754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:10:48,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:10:48,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:10:48,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677880159] [2024-10-24 06:10:48,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:10:48,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:10:48,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:10:48,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:10:48,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:10:48,343 INFO L87 Difference]: Start difference. First operand 76 states and 117 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 06:10:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:10:48,624 INFO L93 Difference]: Finished difference Result 240 states and 367 transitions. [2024-10-24 06:10:48,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:10:48,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-10-24 06:10:48,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:10:48,627 INFO L225 Difference]: With dead ends: 240 [2024-10-24 06:10:48,627 INFO L226 Difference]: Without dead ends: 165 [2024-10-24 06:10:48,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:10:48,631 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 108 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:10:48,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 393 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:10:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-24 06:10:48,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 150. [2024-10-24 06:10:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 06:10:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 233 transitions. [2024-10-24 06:10:48,675 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 233 transitions. Word has length 162 [2024-10-24 06:10:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:10:48,676 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 233 transitions. [2024-10-24 06:10:48,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 06:10:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 233 transitions. [2024-10-24 06:10:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 06:10:48,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:10:48,682 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:10:48,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:10:48,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:10:48,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:10:48,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1110910953, now seen corresponding path program 1 times [2024-10-24 06:10:48,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:10:48,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395481504] [2024-10-24 06:10:48,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:10:48,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:10:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:10:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:10:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:10:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:10:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:10:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:10:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:10:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:10:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:10:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:10:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:10:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:10:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:10:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:10:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 06:10:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:10:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:10:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 06:10:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:10:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 06:10:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:10:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 06:10:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:10:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 06:10:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:10:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 06:10:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 06:10:49,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:10:49,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395481504] [2024-10-24 06:10:49,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395481504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:10:49,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:10:49,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 06:10:49,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709120552] [2024-10-24 06:10:49,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:10:49,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 06:10:49,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:10:49,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 06:10:49,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 06:10:49,688 INFO L87 Difference]: Start difference. First operand 150 states and 233 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 06:10:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:10:50,001 INFO L93 Difference]: Finished difference Result 385 states and 594 transitions. [2024-10-24 06:10:50,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:10:50,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2024-10-24 06:10:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:10:50,004 INFO L225 Difference]: With dead ends: 385 [2024-10-24 06:10:50,004 INFO L226 Difference]: Without dead ends: 236 [2024-10-24 06:10:50,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 06:10:50,006 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 77 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:10:50,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 419 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:10:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-24 06:10:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2024-10-24 06:10:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 138 states have (on average 1.3333333333333333) internal successors, (184), 138 states have internal predecessors, (184), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-24 06:10:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 340 transitions. [2024-10-24 06:10:50,055 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 340 transitions. Word has length 163 [2024-10-24 06:10:50,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:10:50,056 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 340 transitions. [2024-10-24 06:10:50,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 06:10:50,057 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 340 transitions. [2024-10-24 06:10:50,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 06:10:50,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:10:50,062 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:10:50,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:10:50,062 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:10:50,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:10:50,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1489063036, now seen corresponding path program 1 times [2024-10-24 06:10:50,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:10:50,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96605797] [2024-10-24 06:10:50,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:10:50,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:10:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:10:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:10:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:10:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:10:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:10:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:10:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:10:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:10:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:10:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:10:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:10:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:10:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:10:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:10:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 06:10:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:10:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:10:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 06:10:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:10:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 06:10:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:10:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 06:10:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:10:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 06:10:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:10:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 06:10:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 06:10:50,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:10:50,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96605797] [2024-10-24 06:10:50,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96605797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:10:50,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:10:50,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:10:50,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664058365] [2024-10-24 06:10:50,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:10:50,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:10:50,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:10:50,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:10:50,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:10:50,212 INFO L87 Difference]: Start difference. First operand 220 states and 340 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 06:10:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:10:50,296 INFO L93 Difference]: Finished difference Result 457 states and 698 transitions. [2024-10-24 06:10:50,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:10:50,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-10-24 06:10:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:10:50,299 INFO L225 Difference]: With dead ends: 457 [2024-10-24 06:10:50,299 INFO L226 Difference]: Without dead ends: 308 [2024-10-24 06:10:50,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-10-24 06:10:50,304 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 42 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:10:50,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 201 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:10:50,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-24 06:10:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2024-10-24 06:10:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 203 states have (on average 1.3448275862068966) internal successors, (273), 205 states have internal predecessors, (273), 94 states have call successors, (94), 6 states have call predecessors, (94), 6 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-24 06:10:50,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 461 transitions. [2024-10-24 06:10:50,366 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 461 transitions. Word has length 165 [2024-10-24 06:10:50,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:10:50,367 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 461 transitions. [2024-10-24 06:10:50,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 06:10:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 461 transitions. [2024-10-24 06:10:50,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 06:10:50,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:10:50,369 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:10:50,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 06:10:50,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:10:50,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:10:50,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1816770137, now seen corresponding path program 1 times [2024-10-24 06:10:50,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:10:50,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019917108] [2024-10-24 06:10:50,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:10:50,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:10:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:10:50,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [851925372] [2024-10-24 06:10:50,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:10:50,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:10:50,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:10:50,469 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-10-24 06:10:50,470 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-10-24 06:10:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:10:50,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:10:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:10:50,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:10:50,698 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:10:50,698 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:10:50,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 06:10:50,900 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,SelfDestructingSolverStorable5 [2024-10-24 06:10:50,903 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 06:10:51,025 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:10:51,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:10:51 BoogieIcfgContainer [2024-10-24 06:10:51,028 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:10:51,028 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:10:51,029 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:10:51,029 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:10:51,029 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:10:46" (3/4) ... [2024-10-24 06:10:51,032 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:10:51,034 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:10:51,034 INFO L158 Benchmark]: Toolchain (without parser) took 5713.69ms. Allocated memory was 222.3MB in the beginning and 274.7MB in the end (delta: 52.4MB). Free memory was 151.5MB in the beginning and 159.1MB in the end (delta: -7.5MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2024-10-24 06:10:51,034 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:10:51,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.74ms. Allocated memory is still 222.3MB. Free memory was 151.1MB in the beginning and 134.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 06:10:51,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.88ms. Allocated memory is still 222.3MB. Free memory was 134.3MB in the beginning and 130.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:10:51,035 INFO L158 Benchmark]: Boogie Preprocessor took 82.82ms. Allocated memory is still 222.3MB. Free memory was 130.2MB in the beginning and 124.3MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 06:10:51,035 INFO L158 Benchmark]: RCFGBuilder took 568.13ms. Allocated memory is still 222.3MB. Free memory was 124.3MB in the beginning and 93.3MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-24 06:10:51,037 INFO L158 Benchmark]: TraceAbstraction took 4686.84ms. Allocated memory was 222.3MB in the beginning and 274.7MB in the end (delta: 52.4MB). Free memory was 92.8MB in the beginning and 159.1MB in the end (delta: -66.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:10:51,037 INFO L158 Benchmark]: Witness Printer took 5.30ms. Allocated memory is still 274.7MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:10:51,038 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.14ms. Allocated memory is still 121.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.74ms. Allocated memory is still 222.3MB. Free memory was 151.1MB in the beginning and 134.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.88ms. Allocated memory is still 222.3MB. Free memory was 134.3MB in the beginning and 130.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.82ms. Allocated memory is still 222.3MB. Free memory was 130.2MB in the beginning and 124.3MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 568.13ms. Allocated memory is still 222.3MB. Free memory was 124.3MB in the beginning and 93.3MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4686.84ms. Allocated memory was 222.3MB in the beginning and 274.7MB in the end (delta: 52.4MB). Free memory was 92.8MB in the beginning and 159.1MB in the end (delta: -66.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.30ms. Allocated memory is still 274.7MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 156. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 100; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] unsigned short int var_1_8 = 10; [L26] unsigned short int var_1_9 = 0; [L27] unsigned short int var_1_10 = 53946; [L28] unsigned short int var_1_11 = 1; [L29] unsigned long int var_1_12 = 8; [L30] double var_1_13 = 8.25; [L31] signed long int var_1_14 = -256; [L32] double var_1_15 = 0.19999999999999996; [L33] signed long int var_1_16 = -16; [L34] signed char var_1_17 = 1; [L35] signed char var_1_18 = 4; [L36] signed char var_1_19 = 64; [L37] signed long int var_1_20 = 1; [L38] signed long int var_1_21 = 1000000000; [L39] unsigned char var_1_23 = 4; [L40] unsigned char var_1_24 = 8; [L41] signed long int var_1_25 = 64; [L42] unsigned long int var_1_26 = 1; [L43] signed short int var_1_27 = -32; [L44] signed short int var_1_28 = 10; [L45] signed long int var_1_29 = 4; [L46] unsigned char var_1_30 = 0; [L47] unsigned short int last_1_var_1_1 = 100; [L48] unsigned long int last_1_var_1_12 = 8; [L49] double last_1_var_1_13 = 8.25; [L50] signed long int last_1_var_1_16 = -16; [L160] isInitial = 1 [L161] FCALL initially() [L162] COND TRUE 1 [L163] CALL updateLastVariables() [L150] last_1_var_1_1 = var_1_1 [L151] last_1_var_1_12 = var_1_12 [L152] last_1_var_1_13 = var_1_13 [L153] last_1_var_1_16 = var_1_16 [L163] RET updateLastVariables() [L164] CALL updateVariables() [L109] var_1_6 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_7=0, var_1_8=10, var_1_9=0] [L110] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_7=0, var_1_8=10, var_1_9=0] [L111] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L111] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L112] var_1_7 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_8=10, var_1_9=0] [L113] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_8=10, var_1_9=0] [L114] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L114] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L115] var_1_8 = __VERIFIER_nondet_ushort() [L116] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_9=0] [L116] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_9=0] [L117] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L117] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L118] var_1_9 = __VERIFIER_nondet_ushort() [L119] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535] [L119] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535] [L120] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L120] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L121] var_1_10 = __VERIFIER_nondet_ushort() [L122] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L122] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L123] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L123] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L124] var_1_11 = __VERIFIER_nondet_ushort() [L125] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L125] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L126] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L126] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L127] var_1_14 = __VERIFIER_nondet_long() [L128] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L128] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L129] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L129] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L130] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L130] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L131] var_1_15 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L132] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L133] var_1_18 = __VERIFIER_nondet_char() [L134] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L134] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L135] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L135] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L136] var_1_19 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_19 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L137] RET assume_abort_if_not(var_1_19 >= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L138] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L139] var_1_21 = __VERIFIER_nondet_long() [L140] CALL assume_abort_if_not(var_1_21 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L140] RET assume_abort_if_not(var_1_21 >= 536870911) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_21 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L141] RET assume_abort_if_not(var_1_21 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L142] var_1_24 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L143] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L144] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L145] var_1_30 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L146] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L147] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L147] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L164] RET updateVariables() [L165] CALL step() [L54] var_1_23 = var_1_24 [L55] var_1_25 = var_1_24 [L56] var_1_26 = var_1_23 [L57] var_1_27 = var_1_24 [L58] var_1_28 = var_1_24 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L59] EXPR var_1_28 | var_1_25 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L59] COND FALSE !(((- var_1_23) > (var_1_28 | var_1_25)) && var_1_30) [L62] unsigned char stepLocal_0 = last_1_var_1_13 >= last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_0=0, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L63] COND FALSE !((last_1_var_1_12 == last_1_var_1_1) && stepLocal_0) [L74] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=65534, var_1_20=1, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L76] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=65534, var_1_20=1, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L76] COND TRUE (((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16 [L77] COND TRUE \read(var_1_7) [L78] var_1_12 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=125, var_1_19=126, var_1_1=65534, var_1_20=1, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L81] var_1_17 = (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1))))) [L82] unsigned long int stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=65534, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=-121, var_1_18=125, var_1_19=126, var_1_1=65534, var_1_20=1, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L83] COND TRUE \read(var_1_6) [L84] var_1_20 = ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=65534, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=-121, var_1_18=125, var_1_19=126, var_1_1=65534, var_1_20=-536805376, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L92] unsigned char stepLocal_3 = var_1_6; [L93] unsigned char stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_2=1, stepLocal_3=1, stepLocal_4=65534, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=-121, var_1_18=125, var_1_19=126, var_1_1=65534, var_1_20=-536805376, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L94] COND FALSE !(stepLocal_2 && (var_1_9 < (var_1_10 + var_1_20))) [L99] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=1, stepLocal_4=65534, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=33/4, var_1_14=-1, var_1_16=1, var_1_17=-121, var_1_18=125, var_1_19=126, var_1_1=65534, var_1_20=-536805376, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L101] signed long int stepLocal_1 = ((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14); VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_1=65534, stepLocal_3=1, stepLocal_4=65534, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=33/4, var_1_14=-1, var_1_16=1, var_1_17=-121, var_1_18=125, var_1_19=126, var_1_1=65534, var_1_20=-536805376, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L102] COND TRUE stepLocal_1 >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8))) [L103] var_1_13 = var_1_15 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=1, stepLocal_4=65534, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=-121, var_1_18=125, var_1_19=126, var_1_1=65534, var_1_20=-536805376, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L165] RET step() [L166] CALL, EXPR property() [L156] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=-121, var_1_18=125, var_1_19=126, var_1_1=65534, var_1_20=-536805376, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L156] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=-121, var_1_18=125, var_1_19=126, var_1_1=65534, var_1_20=-536805376, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L156] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=-121, var_1_18=125, var_1_19=126, var_1_1=65534, var_1_20=-536805376, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L156-L157] return (((((((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1)) && (((((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14)) >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8)))) ? (var_1_13 == ((double) var_1_15)) : (var_1_13 == ((double) var_1_15)))) && ((var_1_6 && (var_1_9 < (var_1_10 + var_1_20))) ? ((var_1_7 && var_1_6) ? (var_1_16 == ((signed long int) var_1_10)) : 1) : (var_1_16 == ((signed long int) var_1_8)))) && (var_1_17 == ((signed char) (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1)))))))) && (var_1_6 ? (var_1_20 == ((signed long int) ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10))) : (((~ var_1_19) == var_1_12) ? (var_1_20 == ((signed long int) var_1_1)) : (var_1_20 == ((signed long int) var_1_10)))) ; [L166] RET, EXPR property() [L166] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=-121, var_1_18=125, var_1_19=126, var_1_1=65534, var_1_20=-536805376, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=-121, var_1_18=125, var_1_19=126, var_1_1=65534, var_1_20=-536805376, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-65535, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 342 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 1284 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 737 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 334 IncrementalHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 547 mSDtfsCounter, 334 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=5, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 35 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1144 NumberOfCodeBlocks, 1144 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 809 ConstructedInterpolants, 0 QuantifiedInterpolants, 3020 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6500/6500 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-10-24 06:10:51,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-92.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 7e6a9890500b02becbe2374583823016242ae2e1be997dd1bfb050bacebdd67a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:10:53,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:10:53,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:10:53,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:10:53,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:10:53,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:10:53,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:10:53,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:10:53,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:10:53,319 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:10:53,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:10:53,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:10:53,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:10:53,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:10:53,322 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:10:53,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:10:53,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:10:53,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:10:53,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:10:53,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:10:53,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:10:53,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:10:53,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:10:53,327 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:10:53,327 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:10:53,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:10:53,327 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:10:53,327 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:10:53,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:10:53,328 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:10:53,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:10:53,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:10:53,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:10:53,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:10:53,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:10:53,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:10:53,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:10:53,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:10:53,338 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:10:53,339 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:10:53,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:10:53,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:10:53,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:10:53,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:10:53,341 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:10:53,341 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 -> 7e6a9890500b02becbe2374583823016242ae2e1be997dd1bfb050bacebdd67a [2024-10-24 06:10:53,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:10:53,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:10:53,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:10:53,641 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:10:53,641 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:10:53,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-92.i [2024-10-24 06:10:55,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:10:55,282 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:10:55,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-92.i [2024-10-24 06:10:55,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46bf2bec6/f0203f75ef104d799c3e47af2b1da042/FLAGd937612a6 [2024-10-24 06:10:55,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46bf2bec6/f0203f75ef104d799c3e47af2b1da042 [2024-10-24 06:10:55,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:10:55,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:10:55,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:10:55,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:10:55,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:10:55,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:10:55" (1/1) ... [2024-10-24 06:10:55,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d62507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:55, skipping insertion in model container [2024-10-24 06:10:55,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:10:55" (1/1) ... [2024-10-24 06:10:55,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:10:55,861 WARN L248 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_fillercodesize_ps-cn-10_file-92.i[915,928] [2024-10-24 06:10:55,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:10:55,941 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:10:55,954 WARN L248 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_fillercodesize_ps-cn-10_file-92.i[915,928] [2024-10-24 06:10:55,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:10:56,013 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:10:56,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:56 WrapperNode [2024-10-24 06:10:56,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:10:56,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:10:56,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:10:56,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:10:56,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:56" (1/1) ... [2024-10-24 06:10:56,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:56" (1/1) ... [2024-10-24 06:10:56,072 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-10-24 06:10:56,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:10:56,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:10:56,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:10:56,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:10:56,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:56" (1/1) ... [2024-10-24 06:10:56,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:56" (1/1) ... [2024-10-24 06:10:56,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:56" (1/1) ... [2024-10-24 06:10:56,114 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-10-24 06:10:56,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:56" (1/1) ... [2024-10-24 06:10:56,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:56" (1/1) ... [2024-10-24 06:10:56,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:56" (1/1) ... [2024-10-24 06:10:56,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:56" (1/1) ... [2024-10-24 06:10:56,133 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:56" (1/1) ... [2024-10-24 06:10:56,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:56" (1/1) ... [2024-10-24 06:10:56,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:10:56,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:10:56,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:10:56,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:10:56,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:56" (1/1) ... [2024-10-24 06:10:56,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:10:56,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:10:56,178 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-10-24 06:10:56,181 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-10-24 06:10:56,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:10:56,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:10:56,234 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:10:56,234 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:10:56,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:10:56,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:10:56,334 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:10:56,337 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:10:56,670 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 06:10:56,670 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:10:56,719 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:10:56,719 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:10:56,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:10:56 BoogieIcfgContainer [2024-10-24 06:10:56,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:10:56,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:10:56,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:10:56,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:10:56,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:10:55" (1/3) ... [2024-10-24 06:10:56,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4942a225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:10:56, skipping insertion in model container [2024-10-24 06:10:56,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:10:56" (2/3) ... [2024-10-24 06:10:56,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4942a225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:10:56, skipping insertion in model container [2024-10-24 06:10:56,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:10:56" (3/3) ... [2024-10-24 06:10:56,726 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-92.i [2024-10-24 06:10:56,739 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:10:56,739 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:10:56,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:10:56,833 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;@e2d7db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:10:56,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:10:56,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 06:10:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 06:10:56,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:10:56,850 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:10:56,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:10:56,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:10:56,857 INFO L85 PathProgramCache]: Analyzing trace with hash 408761836, now seen corresponding path program 1 times [2024-10-24 06:10:56,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:10:56,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013095010] [2024-10-24 06:10:56,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:10:56,868 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-10-24 06:10:56,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:10:56,871 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-10-24 06:10:56,872 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-10-24 06:10:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:57,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:10:57,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:10:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2024-10-24 06:10:57,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:10:57,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:10:57,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013095010] [2024-10-24 06:10:57,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013095010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:10:57,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:10:57,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:10:57,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216671846] [2024-10-24 06:10:57,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:10:57,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:10:57,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:10:57,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:10:57,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:10:57,177 INFO L87 Difference]: Start difference. First operand has 67 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 06:10:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:10:57,276 INFO L93 Difference]: Finished difference Result 131 states and 236 transitions. [2024-10-24 06:10:57,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:10:57,280 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 158 [2024-10-24 06:10:57,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:10:57,286 INFO L225 Difference]: With dead ends: 131 [2024-10-24 06:10:57,286 INFO L226 Difference]: Without dead ends: 65 [2024-10-24 06:10:57,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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-10-24 06:10:57,293 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:10:57,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:10:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-24 06:10:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-24 06:10:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 06:10:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 101 transitions. [2024-10-24 06:10:57,347 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 101 transitions. Word has length 158 [2024-10-24 06:10:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:10:57,348 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 101 transitions. [2024-10-24 06:10:57,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 06:10:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 101 transitions. [2024-10-24 06:10:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 06:10:57,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:10:57,351 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:10:57,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 (2)] Forceful destruction successful, exit code 0 [2024-10-24 06:10:57,551 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-10-24 06:10:57,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:10:57,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:10:57,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2008137064, now seen corresponding path program 1 times [2024-10-24 06:10:57,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:10:57,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391344354] [2024-10-24 06:10:57,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:10:57,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-10-24 06:10:57,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:10:57,557 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-10-24 06:10:57,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 (3)] Waiting until timeout for monitored process [2024-10-24 06:10:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:57,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 06:10:57,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:10:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 06:10:57,786 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:10:57,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:10:57,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391344354] [2024-10-24 06:10:57,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391344354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:10:57,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:10:57,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:10:57,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306988308] [2024-10-24 06:10:57,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:10:57,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:10:57,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:10:57,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:10:57,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:10:57,789 INFO L87 Difference]: Start difference. First operand 65 states and 101 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 06:10:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:10:57,855 INFO L93 Difference]: Finished difference Result 173 states and 270 transitions. [2024-10-24 06:10:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:10:57,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 158 [2024-10-24 06:10:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:10:57,861 INFO L225 Difference]: With dead ends: 173 [2024-10-24 06:10:57,861 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 06:10:57,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 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-10-24 06:10:57,863 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 98 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 231 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-10-24 06:10:57,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 231 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:10:57,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 06:10:57,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2024-10-24 06:10:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 06:10:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 100 transitions. [2024-10-24 06:10:57,876 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 100 transitions. Word has length 158 [2024-10-24 06:10:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:10:57,878 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 100 transitions. [2024-10-24 06:10:57,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 06:10:57,878 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 100 transitions. [2024-10-24 06:10:57,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 06:10:57,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:10:57,882 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 06:10:57,896 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-10-24 06:10:58,086 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-10-24 06:10:58,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:10:58,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:10:58,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1421331050, now seen corresponding path program 1 times [2024-10-24 06:10:58,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:10:58,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242159567] [2024-10-24 06:10:58,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:10:58,089 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-10-24 06:10:58,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:10:58,091 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-10-24 06:10:58,093 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-10-24 06:10:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:58,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 06:10:58,266 INFO L278 TraceCheckSpWp]: Computing forward predicates...