./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-25.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 6c8d7532b8f18c6853df696f5d1508145b246076a5492060529e54d649f74adf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:19:48,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:19:48,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:19:48,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:19:48,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:19:48,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:19:48,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:19:48,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:19:48,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:19:48,323 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:19:48,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:19:48,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:19:48,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:19:48,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:19:48,326 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:19:48,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:19:48,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:19:48,327 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:19:48,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:19:48,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:19:48,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:19:48,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:19:48,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:19:48,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:19:48,333 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:19:48,333 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:19:48,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:19:48,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:19:48,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:19:48,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:19:48,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:19:48,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:19:48,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:19:48,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:19:48,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:19:48,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:19:48,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:19:48,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:19:48,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:19:48,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:19:48,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:19:48,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:19:48,338 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 -> 6c8d7532b8f18c6853df696f5d1508145b246076a5492060529e54d649f74adf [2024-11-12 03:19:48,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:19:48,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:19:48,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:19:48,630 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:19:48,631 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:19:48,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-25.i [2024-11-12 03:19:50,113 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:19:50,351 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:19:50,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-25.i [2024-11-12 03:19:50,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e4779e0/1d6fa76023bd43ceb27980ec7c285843/FLAG0a745eda9 [2024-11-12 03:19:50,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e4779e0/1d6fa76023bd43ceb27980ec7c285843 [2024-11-12 03:19:50,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:19:50,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:19:50,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:19:50,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:19:50,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:19:50,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:19:50" (1/1) ... [2024-11-12 03:19:50,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b4b311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:19:50, skipping insertion in model container [2024-11-12 03:19:50,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:19:50" (1/1) ... [2024-11-12 03:19:50,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:19:50,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-25.i[919,932] [2024-11-12 03:19:50,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:19:50,688 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:19:50,698 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-25.i[919,932] [2024-11-12 03:19:50,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:19:50,759 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:19:50,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:19:50 WrapperNode [2024-11-12 03:19:50,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:19:50,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:19:50,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:19:50,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:19:50,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:19:50" (1/1) ... [2024-11-12 03:19:50,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:19:50" (1/1) ... [2024-11-12 03:19:50,875 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-11-12 03:19:50,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:19:50,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:19:50,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:19:50,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:19:50,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:19:50" (1/1) ... [2024-11-12 03:19:50,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:19:50" (1/1) ... [2024-11-12 03:19:50,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:19:50" (1/1) ... [2024-11-12 03:19:50,917 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 03:19:50,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:19:50" (1/1) ... [2024-11-12 03:19:50,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:19:50" (1/1) ... [2024-11-12 03:19:50,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:19:50" (1/1) ... [2024-11-12 03:19:50,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:19:50" (1/1) ... [2024-11-12 03:19:50,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:19:50" (1/1) ... [2024-11-12 03:19:50,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:19:50" (1/1) ... [2024-11-12 03:19:50,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:19:50,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:19:50,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:19:50,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:19:50,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:19:50" (1/1) ... [2024-11-12 03:19:50,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:19:50,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:19:50,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 03:19:50,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 03:19:51,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:19:51,035 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:19:51,035 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:19:51,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:19:51,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:19:51,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:19:51,116 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:19:51,118 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:19:51,491 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 03:19:51,491 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:19:51,505 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:19:51,506 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:19:51,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:19:51 BoogieIcfgContainer [2024-11-12 03:19:51,507 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:19:51,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:19:51,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:19:51,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:19:51,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:19:50" (1/3) ... [2024-11-12 03:19:51,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c05f0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:19:51, skipping insertion in model container [2024-11-12 03:19:51,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:19:50" (2/3) ... [2024-11-12 03:19:51,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c05f0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:19:51, skipping insertion in model container [2024-11-12 03:19:51,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:19:51" (3/3) ... [2024-11-12 03:19:51,516 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-25.i [2024-11-12 03:19:51,532 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:19:51,532 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:19:51,587 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:19:51,593 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;@1e413137, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:19:51,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:19:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 66 states have internal predecessors, (100), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 03:19:51,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-12 03:19:51,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:19:51,607 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:19:51,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:19:51,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:19:51,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1837770925, now seen corresponding path program 1 times [2024-11-12 03:19:51,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:19:51,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482928738] [2024-11-12 03:19:51,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:19:51,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:19:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:51,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:19:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:51,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 03:19:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:51,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 03:19:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:51,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:19:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:51,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:19:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:51,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:19:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:51,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 03:19:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:51,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:19:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:51,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:19:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:51,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:19:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:51,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:19:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:51,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:19:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:51,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:19:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:19:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 03:19:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:19:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 03:19:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:19:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 03:19:52,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:19:52,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482928738] [2024-11-12 03:19:52,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482928738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:19:52,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:19:52,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:19:52,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684542618] [2024-11-12 03:19:52,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:19:52,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:19:52,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:19:52,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:19:52,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:19:52,075 INFO L87 Difference]: Start difference. First operand has 86 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 66 states have internal predecessors, (100), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 03:19:52,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:19:52,131 INFO L93 Difference]: Finished difference Result 164 states and 283 transitions. [2024-11-12 03:19:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:19:52,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2024-11-12 03:19:52,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:19:52,147 INFO L225 Difference]: With dead ends: 164 [2024-11-12 03:19:52,148 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 03:19:52,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:19:52,155 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:19:52,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:19:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 03:19:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-12 03:19:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 61 states have internal predecessors, (91), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 03:19:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2024-11-12 03:19:52,193 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 127 transitions. Word has length 130 [2024-11-12 03:19:52,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:19:52,194 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 127 transitions. [2024-11-12 03:19:52,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 03:19:52,194 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 127 transitions. [2024-11-12 03:19:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-12 03:19:52,198 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:19:52,198 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:19:52,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 03:19:52,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:19:52,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:19:52,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2109726167, now seen corresponding path program 1 times [2024-11-12 03:19:52,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:19:52,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811233877] [2024-11-12 03:19:52,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:19:52,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:19:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:19:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 03:19:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 03:19:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:19:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:19:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:19:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 03:19:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:19:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:19:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:19:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:19:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:19:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:19:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:19:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 03:19:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:19:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 03:19:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:19:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 03:19:52,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:19:52,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811233877] [2024-11-12 03:19:52,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811233877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:19:52,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:19:52,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:19:52,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827506990] [2024-11-12 03:19:52,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:19:52,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:19:52,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:19:52,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:19:52,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:19:52,538 INFO L87 Difference]: Start difference. First operand 81 states and 127 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 03:19:52,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:19:52,638 INFO L93 Difference]: Finished difference Result 235 states and 371 transitions. [2024-11-12 03:19:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:19:52,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-12 03:19:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:19:52,644 INFO L225 Difference]: With dead ends: 235 [2024-11-12 03:19:52,646 INFO L226 Difference]: Without dead ends: 157 [2024-11-12 03:19:52,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:19:52,649 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 114 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:19:52,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 238 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:19:52,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-12 03:19:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 105. [2024-11-12 03:19:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 85 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 03:19:52,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 164 transitions. [2024-11-12 03:19:52,677 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 164 transitions. Word has length 130 [2024-11-12 03:19:52,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:19:52,679 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 164 transitions. [2024-11-12 03:19:52,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 03:19:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 164 transitions. [2024-11-12 03:19:52,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 03:19:52,682 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:19:52,682 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:19:52,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 03:19:52,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:19:52,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:19:52,683 INFO L85 PathProgramCache]: Analyzing trace with hash 560157036, now seen corresponding path program 1 times [2024-11-12 03:19:52,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:19:52,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790285546] [2024-11-12 03:19:52,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:19:52,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:19:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:19:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 03:19:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 03:19:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:19:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:19:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:19:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 03:19:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:19:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:19:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:19:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:19:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:19:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:19:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:19:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 03:19:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:19:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 03:19:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:19:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 03:19:52,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:19:52,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790285546] [2024-11-12 03:19:52,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790285546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:19:52,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:19:52,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:19:52,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074816824] [2024-11-12 03:19:52,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:19:52,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:19:52,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:19:52,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:19:52,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:19:52,983 INFO L87 Difference]: Start difference. First operand 105 states and 164 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 03:19:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:19:53,169 INFO L93 Difference]: Finished difference Result 244 states and 377 transitions. [2024-11-12 03:19:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:19:53,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2024-11-12 03:19:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:19:53,173 INFO L225 Difference]: With dead ends: 244 [2024-11-12 03:19:53,175 INFO L226 Difference]: Without dead ends: 142 [2024-11-12 03:19:53,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:19:53,179 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 47 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:19:53,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 308 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:19:53,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-12 03:19:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 127. [2024-11-12 03:19:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 03:19:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2024-11-12 03:19:53,205 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 131 [2024-11-12 03:19:53,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:19:53,206 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2024-11-12 03:19:53,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 03:19:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2024-11-12 03:19:53,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 03:19:53,211 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:19:53,211 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:19:53,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 03:19:53,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:19:53,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:19:53,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1028190866, now seen corresponding path program 1 times [2024-11-12 03:19:53,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:19:53,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730481552] [2024-11-12 03:19:53,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:19:53,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:19:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:19:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 03:19:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 03:19:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:19:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:19:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:19:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 03:19:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:19:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:19:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:19:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:19:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:19:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:19:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:19:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 03:19:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:19:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 03:19:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:19:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 03:19:53,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:19:53,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730481552] [2024-11-12 03:19:53,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730481552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:19:53,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:19:53,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:19:53,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268961456] [2024-11-12 03:19:53,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:19:53,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:19:53,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:19:53,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:19:53,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:19:53,587 INFO L87 Difference]: Start difference. First operand 127 states and 193 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 03:19:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:19:53,665 INFO L93 Difference]: Finished difference Result 286 states and 442 transitions. [2024-11-12 03:19:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:19:53,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2024-11-12 03:19:53,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:19:53,670 INFO L225 Difference]: With dead ends: 286 [2024-11-12 03:19:53,670 INFO L226 Difference]: Without dead ends: 184 [2024-11-12 03:19:53,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:19:53,672 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 55 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:19:53,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 213 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:19:53,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-12 03:19:53,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 162. [2024-11-12 03:19:53,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 122 states have (on average 1.4426229508196722) internal successors, (176), 122 states have internal predecessors, (176), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 03:19:53,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 248 transitions. [2024-11-12 03:19:53,707 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 248 transitions. Word has length 131 [2024-11-12 03:19:53,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:19:53,708 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 248 transitions. [2024-11-12 03:19:53,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 03:19:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 248 transitions. [2024-11-12 03:19:53,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 03:19:53,711 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:19:53,711 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:19:53,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 03:19:53,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:19:53,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:19:53,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1339281877, now seen corresponding path program 1 times [2024-11-12 03:19:53,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:19:53,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078010186] [2024-11-12 03:19:53,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:19:53,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:19:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:53,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:19:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 03:19:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 03:19:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:19:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:19:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:19:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 03:19:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:19:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:19:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:19:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:19:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:19:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:19:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:19:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 03:19:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:19:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 03:19:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:19:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,056 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 03:19:54,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:19:54,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078010186] [2024-11-12 03:19:54,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078010186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:19:54,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:19:54,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:19:54,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243854420] [2024-11-12 03:19:54,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:19:54,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:19:54,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:19:54,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:19:54,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:19:54,058 INFO L87 Difference]: Start difference. First operand 162 states and 248 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 03:19:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:19:54,208 INFO L93 Difference]: Finished difference Result 263 states and 405 transitions. [2024-11-12 03:19:54,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:19:54,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2024-11-12 03:19:54,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:19:54,213 INFO L225 Difference]: With dead ends: 263 [2024-11-12 03:19:54,213 INFO L226 Difference]: Without dead ends: 145 [2024-11-12 03:19:54,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:19:54,216 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 147 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:19:54,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 204 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:19:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-12 03:19:54,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 133. [2024-11-12 03:19:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 03:19:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 196 transitions. [2024-11-12 03:19:54,250 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 196 transitions. Word has length 131 [2024-11-12 03:19:54,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:19:54,251 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 196 transitions. [2024-11-12 03:19:54,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 03:19:54,251 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 196 transitions. [2024-11-12 03:19:54,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 03:19:54,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:19:54,253 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:19:54,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 03:19:54,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:19:54,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:19:54,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1365422293, now seen corresponding path program 1 times [2024-11-12 03:19:54,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:19:54,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447757223] [2024-11-12 03:19:54,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:19:54,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:19:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:19:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 03:19:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 03:19:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:19:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:19:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:19:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 03:19:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:19:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:19:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:19:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:19:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:19:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:19:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:19:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 03:19:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:19:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 03:19:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:19:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 03:19:54,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:19:54,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447757223] [2024-11-12 03:19:54,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447757223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:19:54,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:19:54,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 03:19:54,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783593654] [2024-11-12 03:19:54,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:19:54,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 03:19:54,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:19:54,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 03:19:54,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:19:54,724 INFO L87 Difference]: Start difference. First operand 133 states and 196 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 03:19:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:19:55,141 INFO L93 Difference]: Finished difference Result 268 states and 390 transitions. [2024-11-12 03:19:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 03:19:55,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2024-11-12 03:19:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:19:55,144 INFO L225 Difference]: With dead ends: 268 [2024-11-12 03:19:55,145 INFO L226 Difference]: Without dead ends: 191 [2024-11-12 03:19:55,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-12 03:19:55,147 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 173 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:19:55,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 464 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 03:19:55,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-12 03:19:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2024-11-12 03:19:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 127 states have (on average 1.3228346456692914) internal successors, (168), 128 states have internal predecessors, (168), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-12 03:19:55,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 260 transitions. [2024-11-12 03:19:55,176 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 260 transitions. Word has length 131 [2024-11-12 03:19:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:19:55,178 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 260 transitions. [2024-11-12 03:19:55,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 03:19:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 260 transitions. [2024-11-12 03:19:55,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-12 03:19:55,179 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:19:55,180 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:19:55,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 03:19:55,180 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:19:55,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:19:55,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1676349166, now seen corresponding path program 1 times [2024-11-12 03:19:55,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:19:55,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097025404] [2024-11-12 03:19:55,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:19:55,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:19:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:19:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 03:19:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 03:19:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:19:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:19:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:19:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 03:19:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:19:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:19:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:19:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:19:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:19:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:19:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:19:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 03:19:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:19:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 03:19:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:19:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:19:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 03:19:55,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:19:55,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097025404] [2024-11-12 03:19:55,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097025404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:19:55,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:19:55,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:19:55,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146924163] [2024-11-12 03:19:55,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:19:55,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:19:55,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:19:55,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:19:55,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:19:55,685 INFO L87 Difference]: Start difference. First operand 178 states and 260 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 03:19:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:19:55,797 INFO L93 Difference]: Finished difference Result 329 states and 476 transitions. [2024-11-12 03:19:55,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:19:55,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 132 [2024-11-12 03:19:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:19:55,802 INFO L225 Difference]: With dead ends: 329 [2024-11-12 03:19:55,802 INFO L226 Difference]: Without dead ends: 215 [2024-11-12 03:19:55,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:19:55,804 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 110 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:19:55,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 245 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:19:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-12 03:19:55,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 190. [2024-11-12 03:19:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 136 states have (on average 1.286764705882353) internal successors, (175), 137 states have internal predecessors, (175), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-12 03:19:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 267 transitions. [2024-11-12 03:19:55,831 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 267 transitions. Word has length 132 [2024-11-12 03:19:55,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:19:55,832 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 267 transitions. [2024-11-12 03:19:55,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 03:19:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 267 transitions. [2024-11-12 03:19:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-12 03:19:55,834 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:19:55,835 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:19:55,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 03:19:55,835 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:19:55,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:19:55,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1934514604, now seen corresponding path program 1 times [2024-11-12 03:19:55,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:19:55,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509081736] [2024-11-12 03:19:55,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:19:55,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:19:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:19:55,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [51181667] [2024-11-12 03:19:55,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:19:55,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:19:55,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:19:55,897 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:19:55,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 03:19:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:19:56,125 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 03:19:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:19:56,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 03:19:56,367 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 03:19:56,368 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 03:19:56,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 03:19:56,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:19:56,573 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:19:56,700 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 03:19:56,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:19:56 BoogieIcfgContainer [2024-11-12 03:19:56,703 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 03:19:56,704 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 03:19:56,704 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 03:19:56,704 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 03:19:56,705 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:19:51" (3/4) ... [2024-11-12 03:19:56,707 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 03:19:56,708 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 03:19:56,708 INFO L158 Benchmark]: Toolchain (without parser) took 6323.20ms. Allocated memory was 186.6MB in the beginning and 239.1MB in the end (delta: 52.4MB). Free memory was 117.1MB in the beginning and 131.4MB in the end (delta: -14.3MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2024-11-12 03:19:56,708 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:19:56,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.45ms. Allocated memory is still 186.6MB. Free memory was 116.9MB in the beginning and 100.0MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 03:19:56,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.61ms. Allocated memory is still 186.6MB. Free memory was 100.0MB in the beginning and 154.1MB in the end (delta: -54.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 03:19:56,709 INFO L158 Benchmark]: Boogie Preprocessor took 81.97ms. Allocated memory is still 186.6MB. Free memory was 153.3MB in the beginning and 148.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 03:19:56,710 INFO L158 Benchmark]: RCFGBuilder took 544.15ms. Allocated memory is still 186.6MB. Free memory was 148.5MB in the beginning and 121.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-12 03:19:56,710 INFO L158 Benchmark]: TraceAbstraction took 5194.33ms. Allocated memory was 186.6MB in the beginning and 239.1MB in the end (delta: 52.4MB). Free memory was 120.5MB in the beginning and 131.4MB in the end (delta: -10.9MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2024-11-12 03:19:56,710 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 239.1MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:19:56,712 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.17ms. Allocated memory is still 121.6MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.45ms. Allocated memory is still 186.6MB. Free memory was 116.9MB in the beginning and 100.0MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.61ms. Allocated memory is still 186.6MB. Free memory was 100.0MB in the beginning and 154.1MB in the end (delta: -54.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.97ms. Allocated memory is still 186.6MB. Free memory was 153.3MB in the beginning and 148.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 544.15ms. Allocated memory is still 186.6MB. Free memory was 148.5MB in the beginning and 121.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5194.33ms. Allocated memory was 186.6MB in the beginning and 239.1MB in the end (delta: 52.4MB). Free memory was 120.5MB in the beginning and 131.4MB in the end (delta: -10.9MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 239.1MB. Free memory is still 131.4MB. 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 195, overapproximation of someBinaryFLOATComparisonOperation at line 195. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -256; [L23] signed short int var_1_5 = -256; [L24] double var_1_7 = 256.25; [L25] double var_1_8 = 127.8; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] float var_1_12 = 999.75; [L29] float var_1_13 = 64.5; [L30] float var_1_14 = 127.25; [L31] signed char var_1_15 = -32; [L32] float var_1_16 = 32.7; [L33] unsigned char var_1_17 = 16; [L34] unsigned char var_1_18 = 32; [L35] unsigned short int var_1_19 = 5; [L36] signed long int var_1_21 = 100; [L37] signed short int var_1_22 = 50; [L38] double var_1_23 = 1000000.75; [L39] unsigned long int var_1_24 = 16; [L40] double var_1_28 = 15.5; [L41] unsigned long int var_1_30 = 5; [L42] signed long int var_1_32 = 32; [L43] float var_1_34 = 7.5; [L44] unsigned short int var_1_35 = 100; [L45] unsigned short int var_1_37 = 47055; [L46] signed char var_1_39 = -64; [L47] double var_1_40 = 16.75; [L48] signed char var_1_41 = 16; [L49] signed long int last_1_var_1_1 = -256; [L50] signed short int last_1_var_1_5 = -256; [L51] unsigned char last_1_var_1_10 = 0; [L52] unsigned short int last_1_var_1_19 = 5; [L53] signed short int last_1_var_1_22 = 50; VAL [isInitial=0, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5] [L199] isInitial = 1 [L200] FCALL initially() [L201] COND TRUE 1 [L202] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_5 = var_1_5 [L190] last_1_var_1_10 = var_1_10 [L191] last_1_var_1_19 = var_1_19 [L192] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5] [L202] RET updateLastVariables() [L203] CALL updateVariables() [L157] var_1_7 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L158] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L159] var_1_8 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L160] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L161] var_1_11 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L162] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L163] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L163] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L164] var_1_13 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L165] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L166] var_1_14 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L167] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L168] var_1_15 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L169] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L170] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L170] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L171] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L171] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L172] var_1_16 = __VERIFIER_nondet_float() [L173] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L173] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L174] var_1_18 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L175] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L176] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L176] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L177] var_1_37 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_37 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L178] RET assume_abort_if_not(var_1_37 >= 32767) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L179] CALL assume_abort_if_not(var_1_37 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L179] RET assume_abort_if_not(var_1_37 <= 65534) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L180] var_1_40 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_41=16, var_1_5=-256] [L181] RET assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_41=16, var_1_5=-256] [L182] CALL assume_abort_if_not(var_1_40 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_41=16, var_1_5=-256] [L182] RET assume_abort_if_not(var_1_40 != 0.0F) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_41=16, var_1_5=-256] [L183] var_1_41 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_41=0, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_41=0, var_1_5=-256] [L184] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_41=0, var_1_5=-256] [L185] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_41=0, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_41=0, var_1_5=-256] [L185] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_41=0, var_1_5=-256] [L203] RET updateVariables() [L204] CALL step() [L57] signed long int stepLocal_2 = last_1_var_1_5; [L58] unsigned char stepLocal_1 = last_1_var_1_10; [L59] signed long int stepLocal_0 = 256; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_1=0, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_41=0, var_1_5=-256] [L60] COND FALSE !(stepLocal_1 && (last_1_var_1_5 >= last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_41=0, var_1_5=-256] [L65] COND TRUE last_1_var_1_1 >= stepLocal_2 [L66] var_1_1 = last_1_var_1_5 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_41=0, var_1_5=-256] [L71] COND FALSE !(var_1_14 > var_1_7) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=-64, var_1_41=0, var_1_5=-256] [L82] COND FALSE !(((var_1_7 / var_1_40) * var_1_14) > var_1_14) [L91] var_1_39 = var_1_41 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L93] var_1_10 = (last_1_var_1_10 && var_1_11) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L94] COND FALSE !(var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L99] COND FALSE !(var_1_19 < var_1_18) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L104] COND FALSE !(var_1_10 || (var_1_19 <= var_1_18)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L110] var_1_34 = var_1_14 [L111] var_1_22 = last_1_var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=100, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L112] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=100, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L115] var_1_23 = var_1_14 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=100, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L116] COND FALSE !(var_1_10 || var_1_10) [L119] var_1_30 = var_1_17 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=16, var_1_32=32, var_1_34=2, var_1_35=100, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L121] unsigned char stepLocal_5 = var_1_10; [L122] unsigned char stepLocal_4 = var_1_18; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_4=257, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=16, var_1_32=32, var_1_34=2, var_1_35=100, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L123] COND FALSE !(var_1_22 < stepLocal_4) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=16, var_1_32=32, var_1_34=2, var_1_35=100, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L126] COND FALSE !((var_1_10 || var_1_10) || stepLocal_5) [L129] var_1_19 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=50, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=16, var_1_32=32, var_1_34=2, var_1_35=100, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L132] EXPR (var_1_5 % var_1_15) ^ var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=50, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=16, var_1_32=32, var_1_34=2, var_1_35=100, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L132] COND TRUE ((var_1_5 % var_1_15) ^ var_1_19) != var_1_1 [L133] var_1_35 = (((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) - var_1_18) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=50, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=16, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L135] var_1_21 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=50, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=16, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L136] COND TRUE ! (var_1_23 <= var_1_7) [L137] var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=50, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=16, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L145] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=50, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=16, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L146] COND FALSE !(var_1_10 && stepLocal_3) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=50, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=16, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=-256] [L149] COND TRUE (var_1_7 - var_1_8) > var_1_12 [L150] var_1_5 = var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=50, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=16, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=50] [L204] RET step() [L205] CALL, EXPR property() [L195-L196] return (((((((((last_1_var_1_10 && (last_1_var_1_5 >= last_1_var_1_1)) ? ((256 != last_1_var_1_5) ? (var_1_1 == ((signed long int) (last_1_var_1_1 + last_1_var_1_5))) : 1) : ((last_1_var_1_1 >= last_1_var_1_5) ? (var_1_1 == ((signed long int) last_1_var_1_5)) : (var_1_1 == ((signed long int) last_1_var_1_1)))) && ((var_1_10 && var_1_10) ? (var_1_5 == ((signed short int) ((((var_1_19) < (-100)) ? (var_1_19) : (-100))))) : (((var_1_7 - var_1_8) > var_1_12) ? (var_1_5 == ((signed short int) var_1_19)) : (var_1_5 == ((signed short int) var_1_19))))) && (var_1_10 == ((unsigned char) (last_1_var_1_10 && var_1_11)))) && ((! (var_1_23 <= var_1_7)) ? (var_1_12 == ((float) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) : (((((((var_1_1) > (var_1_17)) ? (var_1_1) : (var_1_17))) / var_1_15) < var_1_19) ? (var_1_12 == ((float) var_1_13)) : (var_1_12 == ((float) (var_1_16 + 49.6f)))))) && ((var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) ? (var_1_10 ? (var_1_17 == ((unsigned char) var_1_18)) : 1) : 1)) && ((var_1_22 < var_1_18) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (((var_1_10 || var_1_10) || var_1_10) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (var_1_19 == ((unsigned short int) var_1_22))))) && (var_1_21 == ((signed long int) var_1_22))) && (var_1_22 == ((signed short int) last_1_var_1_22))) && (var_1_23 == ((double) var_1_14)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=50, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=16, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=50] [L205] RET, EXPR property() [L205] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=50, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=16, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=32, var_1_17=16, var_1_18=257, var_1_19=50, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=16, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=98304, var_1_39=0, var_1_41=0, var_1_5=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 646 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 646 mSDsluCounter, 1799 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 934 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 518 IncrementalHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 865 mSDtfsCounter, 518 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=7, InterpolantAutomatonStates: 27, 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, 7 MinimizatonAttempts, 139 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1180 NumberOfCodeBlocks, 1180 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 909 ConstructedInterpolants, 0 QuantifiedInterpolants, 1972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 4284/4284 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 03:19:56,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-25.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 6c8d7532b8f18c6853df696f5d1508145b246076a5492060529e54d649f74adf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:19:58,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:19:59,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 03:19:59,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:19:59,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:19:59,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:19:59,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:19:59,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:19:59,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:19:59,108 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:19:59,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:19:59,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:19:59,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:19:59,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:19:59,112 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:19:59,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:19:59,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:19:59,115 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:19:59,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:19:59,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:19:59,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:19:59,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:19:59,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:19:59,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 03:19:59,116 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 03:19:59,117 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:19:59,117 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 03:19:59,117 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:19:59,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:19:59,118 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:19:59,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:19:59,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:19:59,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:19:59,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:19:59,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:19:59,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:19:59,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:19:59,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:19:59,120 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 03:19:59,120 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 03:19:59,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:19:59,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:19:59,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:19:59,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:19:59,121 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 -> 6c8d7532b8f18c6853df696f5d1508145b246076a5492060529e54d649f74adf [2024-11-12 03:19:59,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:19:59,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:19:59,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:19:59,501 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:19:59,503 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:19:59,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-25.i [2024-11-12 03:20:01,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:20:01,297 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:20:01,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-25.i [2024-11-12 03:20:01,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5eed94bd/d734e3c724484f6c8bcdc3dbc3368f63/FLAG9a240dd17 [2024-11-12 03:20:01,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5eed94bd/d734e3c724484f6c8bcdc3dbc3368f63 [2024-11-12 03:20:01,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:20:01,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:20:01,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:20:01,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:20:01,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:20:01,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:20:01" (1/1) ... [2024-11-12 03:20:01,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6773d3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:20:01, skipping insertion in model container [2024-11-12 03:20:01,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:20:01" (1/1) ... [2024-11-12 03:20:01,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:20:01,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-25.i[919,932] [2024-11-12 03:20:01,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:20:01,681 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:20:01,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-25.i[919,932] [2024-11-12 03:20:01,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:20:01,768 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:20:01,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:20:01 WrapperNode [2024-11-12 03:20:01,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:20:01,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:20:01,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:20:01,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:20:01,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:20:01" (1/1) ... [2024-11-12 03:20:01,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:20:01" (1/1) ... [2024-11-12 03:20:01,838 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-12 03:20:01,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:20:01,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:20:01,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:20:01,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:20:01,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:20:01" (1/1) ... [2024-11-12 03:20:01,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:20:01" (1/1) ... [2024-11-12 03:20:01,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:20:01" (1/1) ... [2024-11-12 03:20:01,886 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 03:20:01,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:20:01" (1/1) ... [2024-11-12 03:20:01,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:20:01" (1/1) ... [2024-11-12 03:20:01,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:20:01" (1/1) ... [2024-11-12 03:20:01,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:20:01" (1/1) ... [2024-11-12 03:20:01,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:20:01" (1/1) ... [2024-11-12 03:20:01,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:20:01" (1/1) ... [2024-11-12 03:20:01,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:20:01,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:20:01,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:20:01,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:20:01,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:20:01" (1/1) ... [2024-11-12 03:20:01,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:20:01,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:20:01,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 03:20:01,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 03:20:02,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:20:02,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 03:20:02,043 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:20:02,043 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:20:02,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:20:02,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:20:02,146 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:20:02,148 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:20:13,171 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 03:20:13,173 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:20:13,187 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:20:13,188 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:20:13,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:20:13 BoogieIcfgContainer [2024-11-12 03:20:13,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:20:13,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:20:13,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:20:13,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:20:13,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:20:01" (1/3) ... [2024-11-12 03:20:13,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1117cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:20:13, skipping insertion in model container [2024-11-12 03:20:13,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:20:01" (2/3) ... [2024-11-12 03:20:13,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1117cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:20:13, skipping insertion in model container [2024-11-12 03:20:13,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:20:13" (3/3) ... [2024-11-12 03:20:13,198 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-25.i [2024-11-12 03:20:13,214 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:20:13,215 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:20:13,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:20:13,286 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;@1fb4537e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:20:13,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:20:13,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 58 states have internal predecessors, (86), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 03:20:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 03:20:13,303 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:20:13,304 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:20:13,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:20:13,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:20:13,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1287515330, now seen corresponding path program 1 times [2024-11-12 03:20:13,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:20:13,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933286741] [2024-11-12 03:20:13,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:20:13,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:20:13,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:20:13,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:20:13,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 03:20:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:20:14,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 03:20:14,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:20:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-12 03:20:14,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:20:14,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:20:14,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933286741] [2024-11-12 03:20:14,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933286741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:20:14,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:20:14,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:20:14,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152374588] [2024-11-12 03:20:14,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:20:14,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:20:14,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:20:14,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:20:14,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:20:14,403 INFO L87 Difference]: Start difference. First operand has 78 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 58 states have internal predecessors, (86), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 03:20:14,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:20:14,437 INFO L93 Difference]: Finished difference Result 149 states and 256 transitions. [2024-11-12 03:20:14,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:20:14,440 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2024-11-12 03:20:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:20:14,448 INFO L225 Difference]: With dead ends: 149 [2024-11-12 03:20:14,448 INFO L226 Difference]: Without dead ends: 74 [2024-11-12 03:20:14,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:20:14,456 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:20:14,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:20:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-12 03:20:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-12 03:20:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 03:20:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2024-11-12 03:20:14,511 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 129 [2024-11-12 03:20:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:20:14,512 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2024-11-12 03:20:14,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 03:20:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2024-11-12 03:20:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 03:20:14,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:20:14,515 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:20:14,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 03:20:14,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:20:14,717 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:20:14,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:20:14,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1720497664, now seen corresponding path program 1 times [2024-11-12 03:20:14,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:20:14,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794992033] [2024-11-12 03:20:14,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:20:14,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:20:14,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:20:14,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:20:14,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 03:20:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:20:15,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 03:20:15,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:20:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 03:20:18,911 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:20:18,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:20:18,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794992033] [2024-11-12 03:20:18,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794992033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:20:18,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:20:18,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:20:18,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908758300] [2024-11-12 03:20:18,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:20:18,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:20:18,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:20:18,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:20:18,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:20:18,917 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 03:20:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:20:19,962 INFO L93 Difference]: Finished difference Result 144 states and 223 transitions. [2024-11-12 03:20:19,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:20:19,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-11-12 03:20:19,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:20:19,978 INFO L225 Difference]: With dead ends: 144 [2024-11-12 03:20:19,978 INFO L226 Difference]: Without dead ends: 73 [2024-11-12 03:20:19,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:20:19,981 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 120 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 03:20:19,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 180 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 03:20:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-12 03:20:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-12 03:20:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 03:20:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2024-11-12 03:20:20,000 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 129 [2024-11-12 03:20:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:20:20,002 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2024-11-12 03:20:20,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 03:20:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2024-11-12 03:20:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-12 03:20:20,004 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:20:20,004 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:20:20,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 03:20:20,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:20:20,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:20:20,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:20:20,206 INFO L85 PathProgramCache]: Analyzing trace with hash 814779460, now seen corresponding path program 1 times [2024-11-12 03:20:20,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:20:20,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518316756] [2024-11-12 03:20:20,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:20:20,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:20:20,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:20:20,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:20:20,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 03:20:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:20:21,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 03:20:21,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:20:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 236 proven. 84 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-12 03:20:55,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:21:14,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:21:14,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518316756] [2024-11-12 03:21:14,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518316756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:21:14,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [835626122] [2024-11-12 03:21:14,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:21:14,608 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 03:21:14,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 03:21:14,610 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 03:21:14,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-12 03:21:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 03:21:16,709 INFO L279 TraceCheckSpWp]: Computing forward predicates...