./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.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 63d28592561f54f4f96e786181b959744072197846b5c63dc5da76e6f0017f40 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:53:12,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:53:12,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 07:53:12,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:53:12,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:53:12,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:53:12,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:53:12,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:53:12,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:53:12,497 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:53:12,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:53:12,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:53:12,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:53:12,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:53:12,500 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:53:12,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:53:12,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:53:12,501 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:53:12,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 07:53:12,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:53:12,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:53:12,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:53:12,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:53:12,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:53:12,504 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:53:12,504 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:53:12,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:53:12,505 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:53:12,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:53:12,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:53:12,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:53:12,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:53:12,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:53:12,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:53:12,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:53:12,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:53:12,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 07:53:12,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 07:53:12,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:53:12,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:53:12,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:53:12,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:53:12,512 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 -> 63d28592561f54f4f96e786181b959744072197846b5c63dc5da76e6f0017f40 [2024-10-24 07:53:12,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:53:12,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:53:12,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:53:12,829 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:53:12,829 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:53:12,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i [2024-10-24 07:53:14,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:53:14,492 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:53:14,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i [2024-10-24 07:53:14,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d3289a93/19e5042baad0419eb9d1a83f2c8a95fb/FLAGed4ed08cd [2024-10-24 07:53:14,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d3289a93/19e5042baad0419eb9d1a83f2c8a95fb [2024-10-24 07:53:14,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:53:14,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:53:14,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:53:14,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:53:14,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:53:14,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:53:14" (1/1) ... [2024-10-24 07:53:14,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b4bf3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:14, skipping insertion in model container [2024-10-24 07:53:14,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:53:14" (1/1) ... [2024-10-24 07:53:14,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:53:14,754 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i[919,932] [2024-10-24 07:53:14,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:53:14,853 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:53:14,864 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i[919,932] [2024-10-24 07:53:14,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:53:14,915 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:53:14,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:14 WrapperNode [2024-10-24 07:53:14,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:53:14,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:53:14,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:53:14,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:53:14,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:14" (1/1) ... [2024-10-24 07:53:14,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:14" (1/1) ... [2024-10-24 07:53:15,003 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-10-24 07:53:15,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:53:15,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:53:15,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:53:15,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:53:15,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:14" (1/1) ... [2024-10-24 07:53:15,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:14" (1/1) ... [2024-10-24 07:53:15,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:14" (1/1) ... [2024-10-24 07:53:15,050 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 07:53:15,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:14" (1/1) ... [2024-10-24 07:53:15,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:14" (1/1) ... [2024-10-24 07:53:15,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:14" (1/1) ... [2024-10-24 07:53:15,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:14" (1/1) ... [2024-10-24 07:53:15,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:14" (1/1) ... [2024-10-24 07:53:15,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:14" (1/1) ... [2024-10-24 07:53:15,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:53:15,087 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:53:15,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:53:15,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:53:15,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:14" (1/1) ... [2024-10-24 07:53:15,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:53:15,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:53:15,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 07:53:15,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 07:53:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:53:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:53:15,194 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:53:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 07:53:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:53:15,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:53:15,299 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:53:15,302 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:53:15,765 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 07:53:15,766 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:53:15,849 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:53:15,850 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:53:15,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:53:15 BoogieIcfgContainer [2024-10-24 07:53:15,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:53:15,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:53:15,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:53:15,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:53:15,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:53:14" (1/3) ... [2024-10-24 07:53:15,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc7c69d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:53:15, skipping insertion in model container [2024-10-24 07:53:15,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:14" (2/3) ... [2024-10-24 07:53:15,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc7c69d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:53:15, skipping insertion in model container [2024-10-24 07:53:15,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:53:15" (3/3) ... [2024-10-24 07:53:15,861 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i [2024-10-24 07:53:15,890 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:53:15,890 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:53:15,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:53:15,970 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;@3e64d94e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:53:15,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:53:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 07:53:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 07:53:15,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:53:15,998 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:53:15,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:53:16,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:53:16,006 INFO L85 PathProgramCache]: Analyzing trace with hash 730920646, now seen corresponding path program 1 times [2024-10-24 07:53:16,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:53:16,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902430220] [2024-10-24 07:53:16,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:53:16,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:53:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:53:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:53:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:53:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 07:53:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:53:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:53:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:53:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:53:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:53:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:53:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:53:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:53:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:53:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:53:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:53:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:53:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:53:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:53:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:53:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:53:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:53:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:53:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:53:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:53:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:53:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 07:53:16,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:53:16,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902430220] [2024-10-24 07:53:16,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902430220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:53:16,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:53:16,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:53:16,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508901128] [2024-10-24 07:53:16,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:53:16,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:53:16,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:53:16,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:53:16,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:53:16,606 INFO L87 Difference]: Start difference. First operand has 81 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 07:53:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:53:16,654 INFO L93 Difference]: Finished difference Result 158 states and 282 transitions. [2024-10-24 07:53:16,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:53:16,660 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2024-10-24 07:53:16,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:53:16,669 INFO L225 Difference]: With dead ends: 158 [2024-10-24 07:53:16,669 INFO L226 Difference]: Without dead ends: 78 [2024-10-24 07:53:16,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:53:16,681 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:53:16,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:53:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-24 07:53:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-24 07:53:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 07:53:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2024-10-24 07:53:16,743 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 161 [2024-10-24 07:53:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:53:16,744 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2024-10-24 07:53:16,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 07:53:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2024-10-24 07:53:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 07:53:16,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:53:16,751 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:53:16,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 07:53:16,754 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:53:16,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:53:16,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2062318154, now seen corresponding path program 1 times [2024-10-24 07:53:16,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:53:16,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381355441] [2024-10-24 07:53:16,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:53:16,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:53:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:53:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:53:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:53:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 07:53:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:53:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:53:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:53:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:53:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:53:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:53:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:53:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:53:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:53:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:53:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:53:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:53:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:53:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:53:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:53:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:53:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:53:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:53:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:53:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:53:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:53:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 07:53:17,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:53:17,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381355441] [2024-10-24 07:53:17,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381355441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:53:17,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:53:17,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:53:17,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803203849] [2024-10-24 07:53:17,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:53:17,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:53:17,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:53:17,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:53:17,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:53:17,585 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 07:53:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:53:17,685 INFO L93 Difference]: Finished difference Result 227 states and 341 transitions. [2024-10-24 07:53:17,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:53:17,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2024-10-24 07:53:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:53:17,689 INFO L225 Difference]: With dead ends: 227 [2024-10-24 07:53:17,690 INFO L226 Difference]: Without dead ends: 150 [2024-10-24 07:53:17,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:53:17,692 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 118 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:53:17,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 286 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:53:17,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-24 07:53:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 118. [2024-10-24 07:53:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 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-10-24 07:53:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 180 transitions. [2024-10-24 07:53:17,719 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 180 transitions. Word has length 161 [2024-10-24 07:53:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:53:17,720 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 180 transitions. [2024-10-24 07:53:17,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 07:53:17,720 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 180 transitions. [2024-10-24 07:53:17,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 07:53:17,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:53:17,730 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:53:17,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 07:53:17,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:53:17,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:53:17,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1839622132, now seen corresponding path program 1 times [2024-10-24 07:53:17,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:53:17,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438194614] [2024-10-24 07:53:17,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:53:17,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:53:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:53:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:53:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:53:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 07:53:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:53:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:53:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:53:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:53:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:53:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:53:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:53:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:53:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:53:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:53:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:53:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:53:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:53:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:53:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:53:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:53:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:53:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:53:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:53:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:53:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:53:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 07:53:18,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:53:18,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438194614] [2024-10-24 07:53:18,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438194614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:53:18,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:53:18,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:53:18,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55877620] [2024-10-24 07:53:18,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:53:18,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:53:18,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:53:18,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:53:18,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:53:18,373 INFO L87 Difference]: Start difference. First operand 118 states and 180 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 07:53:18,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:53:18,490 INFO L93 Difference]: Finished difference Result 267 states and 400 transitions. [2024-10-24 07:53:18,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:53:18,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2024-10-24 07:53:18,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:53:18,494 INFO L225 Difference]: With dead ends: 267 [2024-10-24 07:53:18,494 INFO L226 Difference]: Without dead ends: 150 [2024-10-24 07:53:18,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:53:18,496 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 88 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:53:18,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 347 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:53:18,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-24 07:53:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 119. [2024-10-24 07:53:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 89 states have internal predecessors, (125), 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-10-24 07:53:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 181 transitions. [2024-10-24 07:53:18,519 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 181 transitions. Word has length 161 [2024-10-24 07:53:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:53:18,521 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 181 transitions. [2024-10-24 07:53:18,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 07:53:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 181 transitions. [2024-10-24 07:53:18,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 07:53:18,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:53:18,527 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:53:18,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 07:53:18,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:53:18,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:53:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1531584564, now seen corresponding path program 1 times [2024-10-24 07:53:18,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:53:18,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415761427] [2024-10-24 07:53:18,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:53:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:53:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:53:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:53:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:53:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 07:53:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:53:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:53:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:53:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:53:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:53:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:53:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:53:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:18,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:53:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:19,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:53:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:19,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:53:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:19,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:53:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:19,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:53:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:19,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:53:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:19,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:53:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:19,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:53:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:19,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:53:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:19,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:53:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:19,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:53:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:19,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:53:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:19,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:53:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:19,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:53:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 07:53:19,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:53:19,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415761427] [2024-10-24 07:53:19,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415761427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:53:19,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:53:19,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:53:19,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148786339] [2024-10-24 07:53:19,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:53:19,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:53:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:53:19,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:53:19,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:53:19,060 INFO L87 Difference]: Start difference. First operand 119 states and 181 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 07:53:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:53:19,245 INFO L93 Difference]: Finished difference Result 353 states and 537 transitions. [2024-10-24 07:53:19,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:53:19,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2024-10-24 07:53:19,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:53:19,251 INFO L225 Difference]: With dead ends: 353 [2024-10-24 07:53:19,254 INFO L226 Difference]: Without dead ends: 235 [2024-10-24 07:53:19,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:53:19,256 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 57 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:53:19,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 245 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:53:19,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-24 07:53:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2024-10-24 07:53:19,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 172 states have (on average 1.3953488372093024) internal successors, (240), 174 states have internal predecessors, (240), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 07:53:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 352 transitions. [2024-10-24 07:53:19,309 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 352 transitions. Word has length 161 [2024-10-24 07:53:19,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:53:19,310 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 352 transitions. [2024-10-24 07:53:19,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 07:53:19,310 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 352 transitions. [2024-10-24 07:53:19,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 07:53:19,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:53:19,312 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:53:19,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 07:53:19,313 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:53:19,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:53:19,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1531524982, now seen corresponding path program 1 times [2024-10-24 07:53:19,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:53:19,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033380955] [2024-10-24 07:53:19,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:53:19,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:53:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:53:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:53:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:53:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 07:53:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:53:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:53:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:53:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:53:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:53:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:53:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:53:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:53:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:53:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:53:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:53:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:53:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:53:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:53:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:53:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:53:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:53:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:53:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:53:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:53:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:53:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 33 proven. 39 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-24 07:53:20,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:53:20,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033380955] [2024-10-24 07:53:20,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033380955] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:53:20,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529543241] [2024-10-24 07:53:20,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:53:20,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:53:20,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:53:20,515 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:53:20,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 07:53:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:20,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 07:53:20,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:53:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 633 proven. 72 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-10-24 07:53:22,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:53:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 66 proven. 75 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-10-24 07:53:23,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529543241] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:53:23,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:53:23,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 27 [2024-10-24 07:53:23,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054660757] [2024-10-24 07:53:23,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:53:23,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-24 07:53:23,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:53:23,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-24 07:53:23,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2024-10-24 07:53:23,978 INFO L87 Difference]: Start difference. First operand 233 states and 352 transitions. Second operand has 27 states, 26 states have (on average 3.730769230769231) internal successors, (97), 25 states have internal predecessors, (97), 7 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 7 states have call predecessors, (75), 7 states have call successors, (75) [2024-10-24 07:53:29,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:53:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:53:40,523 INFO L93 Difference]: Finished difference Result 1057 states and 1532 transitions. [2024-10-24 07:53:40,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-10-24 07:53:40,524 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.730769230769231) internal successors, (97), 25 states have internal predecessors, (97), 7 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 7 states have call predecessors, (75), 7 states have call successors, (75) Word has length 161 [2024-10-24 07:53:40,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:53:40,534 INFO L225 Difference]: With dead ends: 1057 [2024-10-24 07:53:40,536 INFO L226 Difference]: Without dead ends: 825 [2024-10-24 07:53:40,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3457 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2010, Invalid=7890, Unknown=0, NotChecked=0, Total=9900 [2024-10-24 07:53:40,544 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1421 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 1123 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 3139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1123 IncrementalHoareTripleChecker+Valid, 2015 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-10-24 07:53:40,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 1128 Invalid, 3139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1123 Valid, 2015 Invalid, 1 Unknown, 0 Unchecked, 9.6s Time] [2024-10-24 07:53:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-24 07:53:40,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 488. [2024-10-24 07:53:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 350 states have (on average 1.32) internal successors, (462), 354 states have internal predecessors, (462), 121 states have call successors, (121), 16 states have call predecessors, (121), 16 states have return successors, (121), 117 states have call predecessors, (121), 121 states have call successors, (121) [2024-10-24 07:53:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 704 transitions. [2024-10-24 07:53:40,692 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 704 transitions. Word has length 161 [2024-10-24 07:53:40,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:53:40,692 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 704 transitions. [2024-10-24 07:53:40,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.730769230769231) internal successors, (97), 25 states have internal predecessors, (97), 7 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 7 states have call predecessors, (75), 7 states have call successors, (75) [2024-10-24 07:53:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 704 transitions. [2024-10-24 07:53:40,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 07:53:40,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:53:40,696 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:53:40,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 07:53:40,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:53:40,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:53:40,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:53:40,898 INFO L85 PathProgramCache]: Analyzing trace with hash -637683256, now seen corresponding path program 1 times [2024-10-24 07:53:40,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:53:40,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613160423] [2024-10-24 07:53:40,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:53:40,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:53:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:53:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:53:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:53:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 07:53:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:53:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:53:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:53:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:53:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:53:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:53:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:53:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:53:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:53:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:53:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:53:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:53:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:53:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:53:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:53:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:53:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:53:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:53:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:53:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:53:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:53:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-24 07:53:41,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:53:41,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613160423] [2024-10-24 07:53:41,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613160423] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:53:41,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846087613] [2024-10-24 07:53:41,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:53:41,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:53:41,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:53:41,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:53:41,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 07:53:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:41,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 07:53:41,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:53:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2024-10-24 07:53:41,830 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:53:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-24 07:53:42,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846087613] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:53:42,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:53:42,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 07:53:42,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201788066] [2024-10-24 07:53:42,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:53:42,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 07:53:42,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:53:42,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 07:53:42,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:53:42,193 INFO L87 Difference]: Start difference. First operand 488 states and 704 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-10-24 07:53:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:53:42,555 INFO L93 Difference]: Finished difference Result 687 states and 976 transitions. [2024-10-24 07:53:42,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 07:53:42,556 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 161 [2024-10-24 07:53:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:53:42,559 INFO L225 Difference]: With dead ends: 687 [2024-10-24 07:53:42,559 INFO L226 Difference]: Without dead ends: 322 [2024-10-24 07:53:42,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-24 07:53:42,561 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 56 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:53:42,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 209 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:53:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-24 07:53:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 310. [2024-10-24 07:53:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 204 states have (on average 1.2009803921568627) internal successors, (245), 205 states have internal predecessors, (245), 87 states have call successors, (87), 18 states have call predecessors, (87), 18 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-24 07:53:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 419 transitions. [2024-10-24 07:53:42,629 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 419 transitions. Word has length 161 [2024-10-24 07:53:42,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:53:42,630 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 419 transitions. [2024-10-24 07:53:42,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-10-24 07:53:42,630 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 419 transitions. [2024-10-24 07:53:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 07:53:42,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:53:42,632 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:53:42,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 07:53:42,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 07:53:42,837 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:53:42,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:53:42,837 INFO L85 PathProgramCache]: Analyzing trace with hash 248266422, now seen corresponding path program 1 times [2024-10-24 07:53:42,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:53:42,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641588827] [2024-10-24 07:53:42,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:53:42,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:53:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:53:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:53:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:53:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 07:53:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:53:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:53:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:53:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:53:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:53:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:53:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:53:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:53:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:53:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:53:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:53:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:53:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:53:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:53:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:53:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:53:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:53:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:53:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:53:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:53:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:53:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 07:53:43,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:53:43,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641588827] [2024-10-24 07:53:43,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641588827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:53:43,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:53:43,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:53:43,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758115080] [2024-10-24 07:53:43,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:53:43,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:53:43,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:53:43,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:53:43,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:53:43,206 INFO L87 Difference]: Start difference. First operand 310 states and 419 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 07:53:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:53:43,465 INFO L93 Difference]: Finished difference Result 502 states and 696 transitions. [2024-10-24 07:53:43,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:53:43,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 162 [2024-10-24 07:53:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:53:43,472 INFO L225 Difference]: With dead ends: 502 [2024-10-24 07:53:43,472 INFO L226 Difference]: Without dead ends: 415 [2024-10-24 07:53:43,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:53:43,473 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 126 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:53:43,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 354 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:53:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-24 07:53:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 393. [2024-10-24 07:53:43,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 259 states have (on average 1.2162162162162162) internal successors, (315), 260 states have internal predecessors, (315), 112 states have call successors, (112), 21 states have call predecessors, (112), 21 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-24 07:53:43,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 539 transitions. [2024-10-24 07:53:43,561 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 539 transitions. Word has length 162 [2024-10-24 07:53:43,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:53:43,562 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 539 transitions. [2024-10-24 07:53:43,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 07:53:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 539 transitions. [2024-10-24 07:53:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 07:53:43,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:53:43,563 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:53:43,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 07:53:43,563 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:53:43,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:53:43,564 INFO L85 PathProgramCache]: Analyzing trace with hash -492397321, now seen corresponding path program 1 times [2024-10-24 07:53:43,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:53:43,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825831808] [2024-10-24 07:53:43,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:53:43,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:53:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 07:53:43,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1872647968] [2024-10-24 07:53:43,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:53:43,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:53:43,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:53:43,689 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:53:43,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 07:53:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:43,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 07:53:43,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:53:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2024-10-24 07:53:44,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:53:45,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:53:45,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825831808] [2024-10-24 07:53:45,455 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 07:53:45,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872647968] [2024-10-24 07:53:45,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872647968] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:53:45,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 07:53:45,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-10-24 07:53:45,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477152297] [2024-10-24 07:53:45,456 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 07:53:45,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 07:53:45,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:53:45,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 07:53:45,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 07:53:45,458 INFO L87 Difference]: Start difference. First operand 393 states and 539 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 07:53:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:53:45,989 INFO L93 Difference]: Finished difference Result 543 states and 748 transitions. [2024-10-24 07:53:45,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 07:53:45,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2024-10-24 07:53:45,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:53:45,992 INFO L225 Difference]: With dead ends: 543 [2024-10-24 07:53:45,992 INFO L226 Difference]: Without dead ends: 373 [2024-10-24 07:53:45,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2024-10-24 07:53:45,994 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 194 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:53:45,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 525 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 07:53:45,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-24 07:53:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 366. [2024-10-24 07:53:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 246 states have (on average 1.2113821138211383) internal successors, (298), 248 states have internal predecessors, (298), 98 states have call successors, (98), 21 states have call predecessors, (98), 21 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-24 07:53:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 494 transitions. [2024-10-24 07:53:46,086 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 494 transitions. Word has length 163 [2024-10-24 07:53:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:53:46,086 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 494 transitions. [2024-10-24 07:53:46,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 07:53:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 494 transitions. [2024-10-24 07:53:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 07:53:46,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:53:46,088 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:53:46,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 07:53:46,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:53:46,289 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:53:46,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:53:46,290 INFO L85 PathProgramCache]: Analyzing trace with hash 477319599, now seen corresponding path program 1 times [2024-10-24 07:53:46,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:53:46,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820698764] [2024-10-24 07:53:46,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:53:46,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:53:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 07:53:46,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220120106] [2024-10-24 07:53:46,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:53:46,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:53:46,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:53:46,425 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:53:46,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 07:53:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:53:46,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 07:53:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:53:46,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 07:53:46,766 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 07:53:46,767 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 07:53:46,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 07:53:46,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:53:46,972 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:53:47,087 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 07:53:47,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:53:47 BoogieIcfgContainer [2024-10-24 07:53:47,089 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 07:53:47,090 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 07:53:47,090 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 07:53:47,090 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 07:53:47,091 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:53:15" (3/4) ... [2024-10-24 07:53:47,093 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 07:53:47,094 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 07:53:47,094 INFO L158 Benchmark]: Toolchain (without parser) took 32566.32ms. Allocated memory was 182.5MB in the beginning and 346.0MB in the end (delta: 163.6MB). Free memory was 125.6MB in the beginning and 192.1MB in the end (delta: -66.4MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. [2024-10-24 07:53:47,095 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 182.5MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:53:47,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.49ms. Allocated memory is still 182.5MB. Free memory was 125.3MB in the beginning and 108.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 07:53:47,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.71ms. Allocated memory is still 182.5MB. Free memory was 108.2MB in the beginning and 103.7MB in the end (delta: 4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 07:53:47,096 INFO L158 Benchmark]: Boogie Preprocessor took 81.61ms. Allocated memory is still 182.5MB. Free memory was 103.7MB in the beginning and 97.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 07:53:47,096 INFO L158 Benchmark]: RCFGBuilder took 763.43ms. Allocated memory is still 182.5MB. Free memory was 97.4MB in the beginning and 147.5MB in the end (delta: -50.2MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2024-10-24 07:53:47,097 INFO L158 Benchmark]: TraceAbstraction took 31236.79ms. Allocated memory was 182.5MB in the beginning and 346.0MB in the end (delta: 163.6MB). Free memory was 146.8MB in the beginning and 193.1MB in the end (delta: -46.3MB). Peak memory consumption was 117.8MB. Max. memory is 16.1GB. [2024-10-24 07:53:47,097 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 346.0MB. Free memory was 193.1MB in the beginning and 192.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:53:47,098 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 182.5MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.49ms. Allocated memory is still 182.5MB. Free memory was 125.3MB in the beginning and 108.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.71ms. Allocated memory is still 182.5MB. Free memory was 108.2MB in the beginning and 103.7MB in the end (delta: 4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.61ms. Allocated memory is still 182.5MB. Free memory was 103.7MB in the beginning and 97.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 763.43ms. Allocated memory is still 182.5MB. Free memory was 97.4MB in the beginning and 147.5MB in the end (delta: -50.2MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * TraceAbstraction took 31236.79ms. Allocated memory was 182.5MB in the beginning and 346.0MB in the end (delta: 163.6MB). Free memory was 146.8MB in the beginning and 193.1MB in the end (delta: -46.3MB). Peak memory consumption was 117.8MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 346.0MB. Free memory was 193.1MB in the beginning and 192.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 179. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.05; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 49.5; [L25] double var_1_8 = 16.75; [L26] unsigned short int var_1_9 = 1; [L27] unsigned long int var_1_11 = 8; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_14 = 32; [L31] unsigned char var_1_15 = 50; [L32] unsigned char var_1_16 = 8; [L33] unsigned char var_1_17 = 32; [L34] unsigned long int var_1_18 = 2; [L35] unsigned long int var_1_19 = 3876014737; [L36] unsigned char var_1_20 = 0; [L37] unsigned short int var_1_21 = 25; [L38] unsigned char var_1_27 = 1; [L39] unsigned char var_1_30 = 1; [L40] unsigned char var_1_31 = 1; [L41] unsigned char var_1_32 = 0; [L42] unsigned long int var_1_33 = 2; [L43] unsigned short int var_1_34 = 0; [L44] signed short int var_1_35 = -10; [L45] double var_1_36 = 128.5; [L46] double var_1_37 = 128.25; [L47] unsigned char var_1_40 = 2; [L48] unsigned char var_1_41 = 25; [L49] unsigned short int var_1_42 = 8; [L50] unsigned long int var_1_43 = 3563499258; [L51] unsigned long int var_1_44 = 1249494912; [L52] double last_1_var_1_1 = 5.05; [L53] unsigned short int last_1_var_1_9 = 1; [L54] unsigned long int last_1_var_1_11 = 8; [L55] unsigned char last_1_var_1_14 = 32; [L56] unsigned char last_1_var_1_20 = 0; [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_9 = var_1_9 [L174] last_1_var_1_11 = var_1_11 [L175] last_1_var_1_14 = var_1_14 [L176] last_1_var_1_20 = var_1_20 [L186] RET updateLastVariables() [L187] CALL updateVariables() [L130] var_1_6 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L131] RET assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L132] var_1_7 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L133] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L134] var_1_8 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L135] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L136] var_1_13 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L137] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L138] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L139] var_1_15 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L140] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L141] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L142] var_1_16 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L143] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L144] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L145] var_1_17 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L146] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L147] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L148] var_1_19 = __VERIFIER_nondet_ulong() [L149] CALL assume_abort_if_not(var_1_19 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L149] RET assume_abort_if_not(var_1_19 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L150] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L151] var_1_30 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L152] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L153] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L154] var_1_32 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L155] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L156] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L156] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L158] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L159] var_1_37 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L160] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L161] var_1_41 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_41 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L162] RET assume_abort_if_not(var_1_41 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_41 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L163] RET assume_abort_if_not(var_1_41 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L164] var_1_43 = __VERIFIER_nondet_ulong() [L165] CALL assume_abort_if_not(var_1_43 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L165] RET assume_abort_if_not(var_1_43 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_43 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L166] RET assume_abort_if_not(var_1_43 <= 4294967295) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L167] var_1_44 = __VERIFIER_nondet_ulong() [L168] CALL assume_abort_if_not(var_1_44 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L168] RET assume_abort_if_not(var_1_44 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_44 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L169] RET assume_abort_if_not(var_1_44 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L187] RET updateVariables() [L188] CALL step() [L60] COND TRUE \read(var_1_13) [L61] var_1_18 = ((var_1_19 - last_1_var_1_9) - last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L65] COND FALSE !(var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L74] COND TRUE var_1_14 >= (~ var_1_9) [L75] var_1_40 = var_1_41 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L77] COND TRUE (8 - 64) <= (var_1_9 - var_1_9) [L78] var_1_14 = (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L82] signed long int stepLocal_0 = - ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))); VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, stepLocal_0=-1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L83] COND FALSE !(var_1_18 >= stepLocal_0) [L86] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L88] var_1_34 = (var_1_14 + 4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L89] COND FALSE !(\read(var_1_12)) [L98] var_1_42 = var_1_14 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L100] COND TRUE (var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14))) [L101] var_1_20 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L103] COND TRUE \read(var_1_20) [L104] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L106] COND TRUE (var_1_9 <= var_1_9) && var_1_12 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L107] EXPR var_1_14 & var_1_14 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L107] COND TRUE ! (((((var_1_18) > (var_1_9)) ? (var_1_18) : (var_1_9))) < (var_1_14 & var_1_14)) [L108] var_1_27 = var_1_30 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L117] var_1_33 = var_1_14 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L118] COND FALSE !(((var_1_36 - var_1_37) + var_1_1) == var_1_1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L121] var_1_11 = (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L122] COND FALSE !(((((var_1_9) < (var_1_14)) ? (var_1_9) : (var_1_14))) > var_1_9) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L125] COND FALSE !(var_1_18 > (- var_1_9)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L188] RET step() [L189] CALL, EXPR property() [L179-L180] return (((((((var_1_18 >= (- ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))) ? (var_1_1 == ((double) (((var_1_6 - var_1_7) - ((((64.75) > (128.725)) ? (64.75) : (128.725)))) + var_1_8))) : (var_1_1 == ((double) var_1_7))) && ((var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) ? ((! ((last_1_var_1_1 == var_1_7) && (last_1_var_1_20 || last_1_var_1_20))) ? ((! (var_1_6 <= var_1_7)) ? (var_1_9 == ((unsigned short int) ((((last_1_var_1_14) < (last_1_var_1_14)) ? (last_1_var_1_14) : (last_1_var_1_14))))) : 1) : (var_1_9 == ((unsigned short int) last_1_var_1_14))) : 1)) && (var_1_11 == ((unsigned long int) (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u))))) && (var_1_20 ? (var_1_12 == ((unsigned char) var_1_13)) : 1)) && (((8 - 64) <= (var_1_9 - var_1_9)) ? (var_1_14 == ((unsigned char) (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_17)))) && (var_1_13 ? (var_1_18 == ((unsigned long int) ((var_1_19 - last_1_var_1_9) - last_1_var_1_11))) : (var_1_18 == ((unsigned long int) (((((var_1_19 - var_1_17)) > (var_1_15)) ? ((var_1_19 - var_1_17)) : (var_1_15))))))) && (((var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) ? (var_1_20 == ((unsigned char) var_1_13)) : 1) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.0s, OverallIterations: 9, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2065 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2060 mSDsluCounter, 3211 SdHoareTripleChecker+Invalid, 9.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2307 mSDsCounter, 1312 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2526 IncrementalHoareTripleChecker+Invalid, 3839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1312 mSolverCounterUnsat, 904 mSDtfsCounter, 2526 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1334 GetRequests, 1204 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3483 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=488occurred in iteration=5, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 443 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 2102 NumberOfCodeBlocks, 2102 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1923 ConstructedInterpolants, 0 QuantifiedInterpolants, 9126 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1148 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 13986/14400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 07:53:47,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.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 63d28592561f54f4f96e786181b959744072197846b5c63dc5da76e6f0017f40 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:53:49,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:53:49,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 07:53:49,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:53:49,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:53:49,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:53:49,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:53:49,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:53:49,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:53:49,491 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:53:49,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:53:49,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:53:49,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:53:49,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:53:49,493 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:53:49,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:53:49,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:53:49,494 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:53:49,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:53:49,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:53:49,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:53:49,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:53:49,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:53:49,499 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 07:53:49,499 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 07:53:49,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:53:49,500 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 07:53:49,500 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:53:49,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:53:49,501 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:53:49,501 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:53:49,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:53:49,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:53:49,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:53:49,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:53:49,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:53:49,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:53:49,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:53:49,502 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 07:53:49,503 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 07:53:49,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:53:49,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:53:49,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:53:49,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:53:49,504 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 07:53:49,504 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 -> 63d28592561f54f4f96e786181b959744072197846b5c63dc5da76e6f0017f40 [2024-10-24 07:53:49,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:53:49,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:53:49,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:53:49,890 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:53:49,891 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:53:49,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i [2024-10-24 07:53:51,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:53:51,843 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:53:51,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i [2024-10-24 07:53:51,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5223cdd02/9c975c90baee481fbfdffc2880e999fe/FLAGbccefd253 [2024-10-24 07:53:51,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5223cdd02/9c975c90baee481fbfdffc2880e999fe [2024-10-24 07:53:51,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:53:51,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:53:51,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:53:51,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:53:51,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:53:51,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:53:51" (1/1) ... [2024-10-24 07:53:51,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608ea645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:51, skipping insertion in model container [2024-10-24 07:53:51,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:53:51" (1/1) ... [2024-10-24 07:53:51,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:53:52,140 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i[919,932] [2024-10-24 07:53:52,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:53:52,231 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:53:52,242 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i[919,932] [2024-10-24 07:53:52,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:53:52,319 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:53:52,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:52 WrapperNode [2024-10-24 07:53:52,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:53:52,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:53:52,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:53:52,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:53:52,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:52" (1/1) ... [2024-10-24 07:53:52,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:52" (1/1) ... [2024-10-24 07:53:52,383 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-10-24 07:53:52,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:53:52,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:53:52,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:53:52,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:53:52,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:52" (1/1) ... [2024-10-24 07:53:52,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:52" (1/1) ... [2024-10-24 07:53:52,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:52" (1/1) ... [2024-10-24 07:53:52,423 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 07:53:52,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:52" (1/1) ... [2024-10-24 07:53:52,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:52" (1/1) ... [2024-10-24 07:53:52,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:52" (1/1) ... [2024-10-24 07:53:52,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:52" (1/1) ... [2024-10-24 07:53:52,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:52" (1/1) ... [2024-10-24 07:53:52,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:52" (1/1) ... [2024-10-24 07:53:52,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:53:52,470 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:53:52,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:53:52,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:53:52,471 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:52" (1/1) ... [2024-10-24 07:53:52,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:53:52,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:53:52,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 07:53:52,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 07:53:52,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:53:52,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 07:53:52,555 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:53:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:53:52,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:53:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:53:52,649 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:53:52,655 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:53:58,985 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 07:53:58,985 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:53:59,063 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:53:59,063 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:53:59,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:53:59 BoogieIcfgContainer [2024-10-24 07:53:59,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:53:59,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:53:59,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:53:59,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:53:59,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:53:51" (1/3) ... [2024-10-24 07:53:59,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ed8d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:53:59, skipping insertion in model container [2024-10-24 07:53:59,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:53:52" (2/3) ... [2024-10-24 07:53:59,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ed8d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:53:59, skipping insertion in model container [2024-10-24 07:53:59,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:53:59" (3/3) ... [2024-10-24 07:53:59,082 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i [2024-10-24 07:53:59,097 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:53:59,097 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:53:59,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:53:59,164 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;@e7cd533, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:53:59,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:53:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 48 states have internal predecessors, (70), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 07:53:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 07:53:59,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:53:59,188 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:53:59,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:53:59,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:53:59,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2032269290, now seen corresponding path program 1 times [2024-10-24 07:53:59,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:53:59,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196067633] [2024-10-24 07:53:59,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:53:59,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:53:59,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:53:59,210 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:53:59,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 07:53:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:53:59,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 07:53:59,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:53:59,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 07:53:59,827 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:53:59,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:53:59,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196067633] [2024-10-24 07:53:59,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196067633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:53:59,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:53:59,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:53:59,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919881810] [2024-10-24 07:53:59,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:53:59,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:53:59,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:53:59,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:53:59,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:53:59,874 INFO L87 Difference]: Start difference. First operand has 75 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 48 states have internal predecessors, (70), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) 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, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 07:54:02,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:54:02,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:54:02,811 INFO L93 Difference]: Finished difference Result 147 states and 263 transitions. [2024-10-24 07:54:02,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:54:02,840 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, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2024-10-24 07:54:02,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:54:02,847 INFO L225 Difference]: With dead ends: 147 [2024-10-24 07:54:02,847 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 07:54:02,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:54:02,854 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-24 07:54:02,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-24 07:54:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 07:54:02,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 07:54:02,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 07:54:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2024-10-24 07:54:02,904 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 161 [2024-10-24 07:54:02,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:54:02,905 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2024-10-24 07:54:02,905 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, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 07:54:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2024-10-24 07:54:02,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 07:54:02,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:54:02,909 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:54:02,927 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-10-24 07:54:03,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:54:03,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:54:03,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:54:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash -702718824, now seen corresponding path program 1 times [2024-10-24 07:54:03,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:54:03,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737639417] [2024-10-24 07:54:03,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:54:03,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:54:03,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:54:03,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:54:03,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 07:54:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:54:03,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 07:54:03,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:54:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2024-10-24 07:54:09,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:54:10,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:54:10,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737639417] [2024-10-24 07:54:10,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737639417] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:54:10,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [77988138] [2024-10-24 07:54:10,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:54:10,297 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 07:54:10,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 07:54:10,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 07:54:10,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-24 07:54:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:54:10,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 07:54:10,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:54:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 07:54:10,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:54:10,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [77988138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:54:10,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 07:54:10,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-24 07:54:10,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804726886] [2024-10-24 07:54:10,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:54:10,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:54:10,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:54:10,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:54:10,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-24 07:54:10,932 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 07:54:13,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:54:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:54:13,809 INFO L93 Difference]: Finished difference Result 291 states and 435 transitions. [2024-10-24 07:54:13,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 07:54:13,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2024-10-24 07:54:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:54:13,814 INFO L225 Difference]: With dead ends: 291 [2024-10-24 07:54:13,814 INFO L226 Difference]: Without dead ends: 219 [2024-10-24 07:54:13,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-24 07:54:13,817 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 213 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-24 07:54:13,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 494 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-24 07:54:13,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-24 07:54:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 211. [2024-10-24 07:54:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 150 states have (on average 1.3733333333333333) internal successors, (206), 152 states have internal predecessors, (206), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 07:54:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 318 transitions. [2024-10-24 07:54:13,862 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 318 transitions. Word has length 161 [2024-10-24 07:54:13,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:54:13,863 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 318 transitions. [2024-10-24 07:54:13,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 07:54:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 318 transitions. [2024-10-24 07:54:13,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 07:54:13,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:54:13,867 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:54:13,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-24 07:54:14,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 07:54:14,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:54:14,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:54:14,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:54:14,269 INFO L85 PathProgramCache]: Analyzing trace with hash -309691814, now seen corresponding path program 1 times [2024-10-24 07:54:14,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:54:14,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75509365] [2024-10-24 07:54:14,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:54:14,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:54:14,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:54:14,272 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:54:14,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 07:54:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:54:14,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 07:54:14,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:54:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2024-10-24 07:54:19,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:54:23,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:54:23,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75509365] [2024-10-24 07:54:23,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75509365] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:54:23,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1266019633] [2024-10-24 07:54:23,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:54:23,899 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 07:54:23,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 07:54:23,902 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 07:54:23,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-24 07:54:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:54:24,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 07:54:24,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:54:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 07:54:26,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:54:26,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1266019633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:54:26,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 07:54:26,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2024-10-24 07:54:26,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414931095] [2024-10-24 07:54:26,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:54:26,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:54:26,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:54:26,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:54:26,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-24 07:54:26,358 INFO L87 Difference]: Start difference. First operand 211 states and 318 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25)