./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_codestructure_normal_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 96b38d981ab2c29d6aa004a84880ce68546a2e4edd87db11e524adc2046dd497 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:22:59,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:22:59,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:22:59,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:22:59,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:22:59,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:22:59,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:22:59,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:22:59,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:22:59,516 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:22:59,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:22:59,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:22:59,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:22:59,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:22:59,521 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:22:59,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:22:59,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:22:59,522 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:22:59,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:22:59,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:22:59,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:22:59,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:22:59,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:22:59,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:22:59,524 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:22:59,525 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:22:59,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:22:59,529 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:22:59,530 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:22:59,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:22:59,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:22:59,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:22:59,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:22:59,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:22:59,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:22:59,531 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:22:59,531 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:22:59,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:22:59,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:22:59,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:22:59,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:22:59,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:22:59,534 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-clean/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-clean/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 -> 96b38d981ab2c29d6aa004a84880ce68546a2e4edd87db11e524adc2046dd497 [2024-10-11 07:22:59,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:22:59,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:22:59,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:22:59,822 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:22:59,822 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:22:59,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i [2024-10-11 07:23:01,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:23:01,621 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:23:01,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i [2024-10-11 07:23:01,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c93169309/d34c2af0069d45d88cc55de0ba7e271b/FLAGffd1c8c4b [2024-10-11 07:23:01,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c93169309/d34c2af0069d45d88cc55de0ba7e271b [2024-10-11 07:23:01,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:23:01,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:23:01,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:23:01,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:23:01,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:23:01,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:23:01" (1/1) ... [2024-10-11 07:23:01,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@459608dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:01, skipping insertion in model container [2024-10-11 07:23:01,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:23:01" (1/1) ... [2024-10-11 07:23:01,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:23:01,890 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_codestructure_normal_file-58.i[913,926] [2024-10-11 07:23:01,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:23:01,995 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:23:02,008 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_codestructure_normal_file-58.i[913,926] [2024-10-11 07:23:02,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:23:02,052 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:23:02,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:02 WrapperNode [2024-10-11 07:23:02,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:23:02,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:23:02,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:23:02,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:23:02,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:02" (1/1) ... [2024-10-11 07:23:02,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:02" (1/1) ... [2024-10-11 07:23:02,112 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2024-10-11 07:23:02,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:23:02,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:23:02,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:23:02,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:23:02,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:02" (1/1) ... [2024-10-11 07:23:02,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:02" (1/1) ... [2024-10-11 07:23:02,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:02" (1/1) ... [2024-10-11 07:23:02,155 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-11 07:23:02,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:02" (1/1) ... [2024-10-11 07:23:02,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:02" (1/1) ... [2024-10-11 07:23:02,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:02" (1/1) ... [2024-10-11 07:23:02,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:02" (1/1) ... [2024-10-11 07:23:02,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:02" (1/1) ... [2024-10-11 07:23:02,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:02" (1/1) ... [2024-10-11 07:23:02,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:23:02,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:23:02,231 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:23:02,231 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:23:02,232 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:02" (1/1) ... [2024-10-11 07:23:02,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:23:02,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:23:02,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:23:02,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:23:02,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:23:02,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:23:02,334 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:23:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:23:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:23:02,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:23:02,432 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:23:02,434 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:23:02,766 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:23:02,766 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:23:02,825 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:23:02,825 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:23:02,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:23:02 BoogieIcfgContainer [2024-10-11 07:23:02,827 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:23:02,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:23:02,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:23:02,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:23:02,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:23:01" (1/3) ... [2024-10-11 07:23:02,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79fb1fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:23:02, skipping insertion in model container [2024-10-11 07:23:02,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:02" (2/3) ... [2024-10-11 07:23:02,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79fb1fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:23:02, skipping insertion in model container [2024-10-11 07:23:02,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:23:02" (3/3) ... [2024-10-11 07:23:02,837 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-58.i [2024-10-11 07:23:02,857 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:23:02,857 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:23:02,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:23:02,932 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;@30091813, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:23:02,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:23:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:23:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 07:23:02,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:23:02,952 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:23:02,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:23:02,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:23:02,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1238365517, now seen corresponding path program 1 times [2024-10-11 07:23:02,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:23:02,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880281292] [2024-10-11 07:23:02,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:23:02,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:23:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:23:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:23:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:23:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:23:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 07:23:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:23:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 07:23:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:23:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:23:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:23:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:23:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:23:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:23:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:23:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:23:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:23:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 07:23:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:23:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 07:23:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:23:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 07:23:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:23:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 07:23:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:23:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 07:23:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:23:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 07:23:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 07:23:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 07:23:03,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:23:03,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880281292] [2024-10-11 07:23:03,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880281292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:23:03,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:23:03,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:23:03,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372705409] [2024-10-11 07:23:03,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:23:03,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:23:03,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:23:03,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:23:03,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:23:03,482 INFO L87 Difference]: Start difference. First operand has 67 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 07:23:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:23:03,530 INFO L93 Difference]: Finished difference Result 131 states and 242 transitions. [2024-10-11 07:23:03,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:23:03,533 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 166 [2024-10-11 07:23:03,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:23:03,543 INFO L225 Difference]: With dead ends: 131 [2024-10-11 07:23:03,543 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 07:23:03,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-11 07:23:03,553 INFO L432 NwaCegarLoop]: 99 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, 99 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-11 07:23:03,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:23:03,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 07:23:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-11 07:23:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:23:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 102 transitions. [2024-10-11 07:23:03,603 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 102 transitions. Word has length 166 [2024-10-11 07:23:03,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:23:03,604 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 102 transitions. [2024-10-11 07:23:03,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 07:23:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 102 transitions. [2024-10-11 07:23:03,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 07:23:03,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:23:03,610 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:23:03,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:23:03,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:23:03,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:23:03,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1114661811, now seen corresponding path program 1 times [2024-10-11 07:23:03,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:23:03,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077640316] [2024-10-11 07:23:03,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:23:03,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:23:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:23:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:23:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:23:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:23:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 07:23:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:23:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 07:23:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:23:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:23:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:23:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:23:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:23:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:23:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:23:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:23:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:23:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 07:23:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:23:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 07:23:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:23:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 07:23:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:23:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 07:23:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:23:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 07:23:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:23:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 07:23:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 07:23:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 07:23:11,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:23:11,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077640316] [2024-10-11 07:23:11,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077640316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:23:11,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:23:11,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 07:23:11,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711807662] [2024-10-11 07:23:11,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:23:11,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 07:23:11,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:23:11,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 07:23:11,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:23:11,843 INFO L87 Difference]: Start difference. First operand 65 states and 102 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 07:23:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:23:13,808 INFO L93 Difference]: Finished difference Result 195 states and 292 transitions. [2024-10-11 07:23:13,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 07:23:13,808 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 166 [2024-10-11 07:23:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:23:13,812 INFO L225 Difference]: With dead ends: 195 [2024-10-11 07:23:13,812 INFO L226 Difference]: Without dead ends: 193 [2024-10-11 07:23:13,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2024-10-11 07:23:13,814 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 268 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 07:23:13,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 390 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 07:23:13,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-11 07:23:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 168. [2024-10-11 07:23:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 100 states have (on average 1.36) internal successors, (136), 101 states have internal predecessors, (136), 63 states have call successors, (63), 4 states have call predecessors, (63), 4 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-11 07:23:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 262 transitions. [2024-10-11 07:23:13,861 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 262 transitions. Word has length 166 [2024-10-11 07:23:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:23:13,862 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 262 transitions. [2024-10-11 07:23:13,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 07:23:13,863 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 262 transitions. [2024-10-11 07:23:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 07:23:13,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:23:13,868 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:23:13,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:23:13,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:23:13,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:23:13,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1794720181, now seen corresponding path program 1 times [2024-10-11 07:23:13,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:23:13,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851841966] [2024-10-11 07:23:13,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:23:13,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:23:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:23:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:23:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:23:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:23:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 07:23:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:23:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 07:23:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:23:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:23:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:23:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:23:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:23:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:23:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:23:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:23:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:23:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 07:23:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:23:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 07:23:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:23:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 07:23:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:23:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 07:23:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:23:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 07:23:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:23:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 07:23:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 07:23:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 07:23:20,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:23:20,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851841966] [2024-10-11 07:23:20,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851841966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:23:20,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:23:20,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 07:23:20,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032048934] [2024-10-11 07:23:20,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:23:20,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 07:23:20,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:23:20,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 07:23:20,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:23:20,669 INFO L87 Difference]: Start difference. First operand 168 states and 262 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 07:23:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:23:21,192 INFO L93 Difference]: Finished difference Result 221 states and 331 transitions. [2024-10-11 07:23:21,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 07:23:21,193 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 166 [2024-10-11 07:23:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:23:21,197 INFO L225 Difference]: With dead ends: 221 [2024-10-11 07:23:21,197 INFO L226 Difference]: Without dead ends: 219 [2024-10-11 07:23:21,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:23:21,199 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 101 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:23:21,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 392 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:23:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-11 07:23:21,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 75. [2024-10-11 07:23:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:23:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 114 transitions. [2024-10-11 07:23:21,226 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 114 transitions. Word has length 166 [2024-10-11 07:23:21,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:23:21,226 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 114 transitions. [2024-10-11 07:23:21,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 07:23:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 114 transitions. [2024-10-11 07:23:21,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 07:23:21,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:23:21,232 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:23:21,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:23:21,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:23:21,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:23:21,233 INFO L85 PathProgramCache]: Analyzing trace with hash -210397798, now seen corresponding path program 1 times [2024-10-11 07:23:21,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:23:21,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450743721] [2024-10-11 07:23:21,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:23:21,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:23:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:23:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:23:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:23:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:23:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 07:23:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:23:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 07:23:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:23:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:23:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:23:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:23:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:23:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:23:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:23:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:23:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:23:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 07:23:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:23:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 07:23:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:23:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 07:23:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:23:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 07:23:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:23:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 07:23:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:23:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 07:23:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 07:23:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-11 07:23:21,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:23:21,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450743721] [2024-10-11 07:23:21,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450743721] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:23:21,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197927540] [2024-10-11 07:23:21,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:23:21,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:23:21,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:23:21,499 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:23:21,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:23:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:21,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 07:23:21,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:23:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2024-10-11 07:23:21,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:23:21,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-11 07:23:21,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197927540] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:23:21,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 07:23:21,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-11 07:23:21,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114339814] [2024-10-11 07:23:21,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 07:23:21,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:23:21,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:23:21,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:23:21,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:23:21,935 INFO L87 Difference]: Start difference. First operand 75 states and 114 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-10-11 07:23:22,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:23:22,178 INFO L93 Difference]: Finished difference Result 155 states and 232 transitions. [2024-10-11 07:23:22,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:23:22,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 167 [2024-10-11 07:23:22,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:23:22,181 INFO L225 Difference]: With dead ends: 155 [2024-10-11 07:23:22,181 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 07:23:22,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 385 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:23:22,184 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 86 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:23:22,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 140 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:23:22,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 07:23:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2024-10-11 07:23:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:23:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2024-10-11 07:23:22,208 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 167 [2024-10-11 07:23:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:23:22,209 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2024-10-11 07:23:22,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-10-11 07:23:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2024-10-11 07:23:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 07:23:22,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:23:22,211 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:23:22,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 07:23:22,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:23:22,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:23:22,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:23:22,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2057375000, now seen corresponding path program 1 times [2024-10-11 07:23:22,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:23:22,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593047561] [2024-10-11 07:23:22,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:23:22,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:23:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:23:22,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [306020668] [2024-10-11 07:23:22,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:23:22,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:23:22,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:23:22,486 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:23:22,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 07:23:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:22,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 07:23:22,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:23:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 07:23:23,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:23:23,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:23:23,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593047561] [2024-10-11 07:23:23,242 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 07:23:23,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306020668] [2024-10-11 07:23:23,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306020668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:23:23,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:23:23,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:23:23,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446569837] [2024-10-11 07:23:23,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:23:23,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:23:23,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:23:23,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:23:23,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:23:23,249 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 07:23:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:23:23,467 INFO L93 Difference]: Finished difference Result 218 states and 318 transitions. [2024-10-11 07:23:23,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:23:23,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 168 [2024-10-11 07:23:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:23:23,470 INFO L225 Difference]: With dead ends: 218 [2024-10-11 07:23:23,470 INFO L226 Difference]: Without dead ends: 146 [2024-10-11 07:23:23,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 165 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-11 07:23:23,474 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 23 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:23:23,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 243 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:23:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-11 07:23:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2024-10-11 07:23:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 07:23:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2024-10-11 07:23:23,526 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 168 [2024-10-11 07:23:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:23:23,527 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2024-10-11 07:23:23,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 07:23:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2024-10-11 07:23:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 07:23:23,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:23:23,529 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:23:23,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 07:23:23,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:23:23,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:23:23,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:23:23,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1356310422, now seen corresponding path program 1 times [2024-10-11 07:23:23,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:23:23,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668418560] [2024-10-11 07:23:23,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:23:23,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:23:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:23:23,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829470446] [2024-10-11 07:23:23,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:23:23,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:23:23,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:23:23,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:23:23,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 07:23:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:23:23,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:23:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:23:24,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:23:24,082 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:23:24,085 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:23:24,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 07:23:24,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:23:24,291 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 07:23:24,402 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:23:24,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:23:24 BoogieIcfgContainer [2024-10-11 07:23:24,407 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:23:24,407 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:23:24,408 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:23:24,408 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:23:24,408 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:23:02" (3/4) ... [2024-10-11 07:23:24,410 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:23:24,412 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:23:24,412 INFO L158 Benchmark]: Toolchain (without parser) took 22764.73ms. Allocated memory was 161.5MB in the beginning and 564.1MB in the end (delta: 402.7MB). Free memory was 93.9MB in the beginning and 481.9MB in the end (delta: -388.0MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-10-11 07:23:24,412 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:23:24,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.42ms. Allocated memory is still 161.5MB. Free memory was 93.9MB in the beginning and 78.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 07:23:24,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.52ms. Allocated memory is still 161.5MB. Free memory was 78.1MB in the beginning and 74.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:23:24,413 INFO L158 Benchmark]: Boogie Preprocessor took 113.42ms. Allocated memory is still 161.5MB. Free memory was 73.9MB in the beginning and 132.2MB in the end (delta: -58.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-10-11 07:23:24,413 INFO L158 Benchmark]: RCFGBuilder took 600.00ms. Allocated memory is still 161.5MB. Free memory was 132.2MB in the beginning and 104.5MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 07:23:24,414 INFO L158 Benchmark]: TraceAbstraction took 21577.78ms. Allocated memory was 161.5MB in the beginning and 564.1MB in the end (delta: 402.7MB). Free memory was 104.0MB in the beginning and 481.9MB in the end (delta: -377.9MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2024-10-11 07:23:24,414 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 564.1MB. Free memory is still 481.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:23:24,415 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 117.4MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.42ms. Allocated memory is still 161.5MB. Free memory was 93.9MB in the beginning and 78.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.52ms. Allocated memory is still 161.5MB. Free memory was 78.1MB in the beginning and 74.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.42ms. Allocated memory is still 161.5MB. Free memory was 73.9MB in the beginning and 132.2MB in the end (delta: -58.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * RCFGBuilder took 600.00ms. Allocated memory is still 161.5MB. Free memory was 132.2MB in the beginning and 104.5MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 21577.78ms. Allocated memory was 161.5MB in the beginning and 564.1MB in the end (delta: 402.7MB). Free memory was 104.0MB in the beginning and 481.9MB in the end (delta: -377.9MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 564.1MB. Free memory is still 481.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 137. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 16; [L25] unsigned char var_1_4 = 4; [L26] unsigned char var_1_5 = 200; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_9 = 0; [L31] signed short int var_1_10 = 128; [L32] signed short int var_1_11 = 5; [L33] signed char var_1_12 = -2; [L34] signed char var_1_13 = -32; [L35] signed char var_1_14 = 2; [L36] signed char var_1_15 = 25; [L37] signed char var_1_16 = 1; [L38] signed char var_1_17 = 0; [L39] signed long int var_1_18 = -16; [L40] float var_1_19 = 2.775; [L41] unsigned long int var_1_20 = 2381110720; [L42] float var_1_21 = 10000000000000.5; [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] FCALL updateLastVariables() [L145] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L94] var_1_3 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L101] var_1_5 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L103] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L104] var_1_6 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_7=0, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_7=0, var_1_8=0, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L106] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L107] var_1_7 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_8=0, var_1_9=0] [L108] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_8=0, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L109] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L110] var_1_8 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_9=0] [L111] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=0] [L112] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=0] [L113] var_1_9 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255] [L114] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255] [L115] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L115] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L116] var_1_13 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L117] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L118] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L118] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L119] var_1_14 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_14 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L120] RET assume_abort_if_not(var_1_14 >= -127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L121] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L121] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L122] var_1_16 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L123] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L124] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L124] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L125] var_1_17 = __VERIFIER_nondet_char() [L126] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L126] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L127] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L127] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L128] var_1_20 = __VERIFIER_nondet_ulong() [L129] CALL assume_abort_if_not(var_1_20 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=8455948824, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=8455948824, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L129] RET assume_abort_if_not(var_1_20 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=8455948824, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L130] CALL assume_abort_if_not(var_1_20 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=8455948824, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=8455948824, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L130] RET assume_abort_if_not(var_1_20 <= 4294967295) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=8455948824, var_1_21=20000000000001/2, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L131] var_1_21 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=8455948824, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=8455948824, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L132] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=8455948824, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L145] RET updateVariables() [L146] CALL step() [L46] COND FALSE !((var_1_2 / var_1_3) <= 2) [L57] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=-512, var_1_20=8455948824, var_1_2=-392, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L59] COND TRUE var_1_3 <= var_1_2 [L60] var_1_10 = ((((var_1_5) < (var_1_3)) ? (var_1_5) : (var_1_3))) VAL [isInitial=1, var_1_10=0, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=-512, var_1_20=8455948824, var_1_2=-392, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L62] COND TRUE var_1_1 >= (((((var_1_2) < (var_1_10)) ? (var_1_2) : (var_1_10))) + var_1_5) [L63] var_1_11 = ((var_1_5 + var_1_2) + var_1_3) VAL [isInitial=1, var_1_10=0, var_1_11=160, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=-512, var_1_20=8455948824, var_1_2=-392, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L69] var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) VAL [isInitial=1, var_1_10=0, var_1_11=160, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=-512, var_1_20=8455948824, var_1_2=-392, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L70] COND TRUE \read(var_1_7) [L71] var_1_15 = (((((32) < ((16 + var_1_16))) ? (32) : ((16 + var_1_16)))) - var_1_17) VAL [isInitial=1, var_1_10=0, var_1_11=160, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=40, var_1_17=24, var_1_18=-16, var_1_19=111/40, var_1_1=-512, var_1_20=8455948824, var_1_2=-392, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L73] COND TRUE var_1_16 <= ((((var_1_13) > (var_1_3)) ? (var_1_13) : (var_1_3))) [L74] var_1_18 = (((((64 - var_1_16)) > (var_1_17)) ? ((64 - var_1_16)) : (var_1_17))) VAL [isInitial=1, var_1_10=0, var_1_11=160, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=40, var_1_17=24, var_1_18=24, var_1_19=111/40, var_1_1=-512, var_1_20=8455948824, var_1_2=-392, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L78] COND TRUE 100000000u < (((((4160981528u) < (var_1_20)) ? (4160981528u) : (var_1_20))) - var_1_1) VAL [isInitial=1, var_1_10=0, var_1_11=160, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=40, var_1_17=24, var_1_18=24, var_1_19=111/40, var_1_1=-512, var_1_20=8455948824, var_1_2=-392, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L79] COND TRUE var_1_20 > 1u VAL [isInitial=1, var_1_10=0, var_1_11=160, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=40, var_1_17=24, var_1_18=24, var_1_19=111/40, var_1_1=-512, var_1_20=8455948824, var_1_2=-392, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L80] COND TRUE \read(var_1_9) [L81] var_1_19 = var_1_21 VAL [isInitial=1, var_1_10=0, var_1_11=160, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=40, var_1_17=24, var_1_18=24, var_1_19=2, var_1_1=-512, var_1_20=8455948824, var_1_21=2, var_1_2=-392, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L146] RET step() [L147] CALL, EXPR property() [L137-L138] return ((((((((var_1_2 / var_1_3) <= 2) ? ((var_1_3 < (((((~ var_1_2)) < (var_1_4)) ? ((~ var_1_2)) : (var_1_4)))) ? (var_1_1 == ((unsigned char) ((((var_1_5) < (16)) ? (var_1_5) : (16))))) : ((((var_1_6 || var_1_7) && var_1_8) || var_1_9) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_5)))) : (var_1_1 == ((unsigned char) var_1_5))) && ((var_1_3 <= var_1_2) ? (var_1_10 == ((signed short int) ((((var_1_5) < (var_1_3)) ? (var_1_5) : (var_1_3))))) : 1)) && ((var_1_1 >= (((((var_1_2) < (var_1_10)) ? (var_1_2) : (var_1_10))) + var_1_5)) ? (var_1_11 == ((signed short int) ((var_1_5 + var_1_2) + var_1_3))) : (var_1_8 ? (var_1_11 == ((signed short int) var_1_3)) : 1))) && (var_1_12 == ((signed char) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) && (var_1_7 ? (var_1_15 == ((signed char) (((((32) < ((16 + var_1_16))) ? (32) : ((16 + var_1_16)))) - var_1_17))) : 1)) && ((var_1_16 <= ((((var_1_13) > (var_1_3)) ? (var_1_13) : (var_1_3)))) ? (var_1_18 == ((signed long int) (((((64 - var_1_16)) > (var_1_17)) ? ((64 - var_1_16)) : (var_1_17))))) : (var_1_18 == ((signed long int) 4)))) && ((100000000u < (((((4160981528u) < (var_1_20)) ? (4160981528u) : (var_1_20))) - var_1_1)) ? ((var_1_20 > 1u) ? (var_1_9 ? (var_1_19 == ((float) var_1_21)) : (var_1_19 == ((float) var_1_21))) : (var_1_19 == ((float) var_1_21))) : 1) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=160, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=40, var_1_17=24, var_1_18=24, var_1_19=2, var_1_1=-512, var_1_20=8455948824, var_1_21=2, var_1_2=-392, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=160, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=40, var_1_17=24, var_1_18=24, var_1_19=2, var_1_1=-512, var_1_20=8455948824, var_1_21=2, var_1_2=-392, var_1_3=40, var_1_5=-512, var_1_6=0, var_1_7=-255, var_1_8=-255, var_1_9=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.4s, OverallIterations: 6, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 503 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 478 mSDsluCounter, 1264 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 787 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 557 IncrementalHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 477 mSDtfsCounter, 557 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 793 GetRequests, 754 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=2, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 179 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 1504 NumberOfCodeBlocks, 1504 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1160 ConstructedInterpolants, 0 QuantifiedInterpolants, 6557 SizeOfPredicates, 2 NumberOfNonLiveVariables, 725 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 10566/10584 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-11 07:23:24,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 96b38d981ab2c29d6aa004a84880ce68546a2e4edd87db11e524adc2046dd497 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:23:26,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:23:26,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:23:26,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:23:26,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:23:27,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:23:27,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:23:27,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:23:27,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:23:27,008 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:23:27,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:23:27,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:23:27,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:23:27,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:23:27,010 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:23:27,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:23:27,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:23:27,013 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:23:27,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:23:27,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:23:27,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:23:27,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:23:27,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:23:27,018 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:23:27,019 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:23:27,019 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:23:27,019 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:23:27,020 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:23:27,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:23:27,020 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:23:27,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:23:27,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:23:27,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:23:27,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:23:27,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:23:27,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:23:27,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:23:27,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:23:27,024 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:23:27,024 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:23:27,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:23:27,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:23:27,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:23:27,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:23:27,026 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:23:27,026 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-clean/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-clean/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 -> 96b38d981ab2c29d6aa004a84880ce68546a2e4edd87db11e524adc2046dd497 [2024-10-11 07:23:27,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:23:27,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:23:27,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:23:27,448 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:23:27,449 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:23:27,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i [2024-10-11 07:23:29,100 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:23:29,362 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:23:29,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i [2024-10-11 07:23:29,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9be726d0c/0d67cb9b00964a07befdd6905ed3eb6e/FLAG66f7e814d [2024-10-11 07:23:29,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9be726d0c/0d67cb9b00964a07befdd6905ed3eb6e [2024-10-11 07:23:29,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:23:29,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:23:29,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:23:29,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:23:29,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:23:29,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:23:29" (1/1) ... [2024-10-11 07:23:29,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79565318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:29, skipping insertion in model container [2024-10-11 07:23:29,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:23:29" (1/1) ... [2024-10-11 07:23:29,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:23:29,951 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_codestructure_normal_file-58.i[913,926] [2024-10-11 07:23:30,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:23:30,034 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:23:30,048 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_codestructure_normal_file-58.i[913,926] [2024-10-11 07:23:30,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:23:30,105 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:23:30,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:30 WrapperNode [2024-10-11 07:23:30,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:23:30,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:23:30,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:23:30,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:23:30,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:30" (1/1) ... [2024-10-11 07:23:30,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:30" (1/1) ... [2024-10-11 07:23:30,160 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2024-10-11 07:23:30,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:23:30,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:23:30,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:23:30,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:23:30,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:30" (1/1) ... [2024-10-11 07:23:30,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:30" (1/1) ... [2024-10-11 07:23:30,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:30" (1/1) ... [2024-10-11 07:23:30,203 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-11 07:23:30,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:30" (1/1) ... [2024-10-11 07:23:30,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:30" (1/1) ... [2024-10-11 07:23:30,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:30" (1/1) ... [2024-10-11 07:23:30,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:30" (1/1) ... [2024-10-11 07:23:30,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:30" (1/1) ... [2024-10-11 07:23:30,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:30" (1/1) ... [2024-10-11 07:23:30,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:23:30,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:23:30,241 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:23:30,241 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:23:30,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:30" (1/1) ... [2024-10-11 07:23:30,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:23:30,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:23:30,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:23:30,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:23:30,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:23:30,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:23:30,321 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:23:30,321 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:23:30,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:23:30,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:23:30,402 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:23:30,404 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:23:30,848 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:23:30,849 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:23:30,947 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:23:30,947 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:23:30,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:23:30 BoogieIcfgContainer [2024-10-11 07:23:30,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:23:30,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:23:30,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:23:30,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:23:30,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:23:29" (1/3) ... [2024-10-11 07:23:30,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2797735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:23:30, skipping insertion in model container [2024-10-11 07:23:30,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:23:30" (2/3) ... [2024-10-11 07:23:30,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2797735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:23:30, skipping insertion in model container [2024-10-11 07:23:30,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:23:30" (3/3) ... [2024-10-11 07:23:30,960 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-58.i [2024-10-11 07:23:30,977 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:23:30,977 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:23:31,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:23:31,063 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;@7ed9a7ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:23:31,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:23:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:23:31,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 07:23:31,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:23:31,082 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:23:31,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:23:31,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:23:31,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1238365517, now seen corresponding path program 1 times [2024-10-11 07:23:31,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:23:31,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131527978] [2024-10-11 07:23:31,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:23:31,107 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-11 07:23:31,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:23:31,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 07:23:31,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:23:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:31,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:23:31,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:23:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 422 proven. 0 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2024-10-11 07:23:31,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:23:31,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:23:31,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131527978] [2024-10-11 07:23:31,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131527978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:23:31,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:23:31,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:23:31,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259590453] [2024-10-11 07:23:31,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:23:31,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:23:31,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:23:31,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:23:31,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:23:31,467 INFO L87 Difference]: Start difference. First operand has 67 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 07:23:31,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:23:31,534 INFO L93 Difference]: Finished difference Result 131 states and 242 transitions. [2024-10-11 07:23:31,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:23:31,539 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 166 [2024-10-11 07:23:31,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:23:31,546 INFO L225 Difference]: With dead ends: 131 [2024-10-11 07:23:31,546 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 07:23:31,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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-11 07:23:31,556 INFO L432 NwaCegarLoop]: 99 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, 99 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-11 07:23:31,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:23:31,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 07:23:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-11 07:23:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:23:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 102 transitions. [2024-10-11 07:23:31,625 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 102 transitions. Word has length 166 [2024-10-11 07:23:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:23:31,626 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 102 transitions. [2024-10-11 07:23:31,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 07:23:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 102 transitions. [2024-10-11 07:23:31,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 07:23:31,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:23:31,631 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:23:31,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:23:31,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 07:23:31,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:23:31,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:23:31,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1114661811, now seen corresponding path program 1 times [2024-10-11 07:23:31,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:23:31,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534006355] [2024-10-11 07:23:31,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:23:31,838 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-11 07:23:31,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:23:31,840 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 07:23:31,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:23:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:32,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 07:23:32,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:23:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 07:23:32,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:23:32,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:23:32,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534006355] [2024-10-11 07:23:32,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534006355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:23:32,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:23:32,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:23:32,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523353379] [2024-10-11 07:23:32,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:23:32,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:23:32,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:23:32,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:23:32,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:23:32,254 INFO L87 Difference]: Start difference. First operand 65 states and 102 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 07:23:32,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:23:32,811 INFO L93 Difference]: Finished difference Result 144 states and 226 transitions. [2024-10-11 07:23:32,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:23:32,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 166 [2024-10-11 07:23:32,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:23:32,821 INFO L225 Difference]: With dead ends: 144 [2024-10-11 07:23:32,821 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 07:23:32,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:23:32,823 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 21 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 07:23:32,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 167 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 07:23:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 07:23:32,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2024-10-11 07:23:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:23:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 103 transitions. [2024-10-11 07:23:32,842 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 103 transitions. Word has length 166 [2024-10-11 07:23:32,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:23:32,844 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 103 transitions. [2024-10-11 07:23:32,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 07:23:32,845 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 103 transitions. [2024-10-11 07:23:32,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 07:23:32,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:23:32,856 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:23:32,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:23:33,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 07:23:33,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:23:33,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:23:33,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1794720181, now seen corresponding path program 1 times [2024-10-11 07:23:33,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:23:33,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227573883] [2024-10-11 07:23:33,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:23:33,067 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-11 07:23:33,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:23:33,070 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 07:23:33,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 07:23:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:33,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 07:23:33,228 INFO L278 TraceCheckSpWp]: Computing forward predicates...