./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.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_fillercode_fillercodestructure_filler-pe-ci_file-11.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 7a5e3c5868bad164e21cd0fc02186c2fb27c3de8083d1633d4818509bd4b4b8d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:52:00,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:52:00,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:52:00,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:52:00,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:52:00,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:52:00,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:52:00,923 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:52:00,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:52:00,928 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:52:00,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:52:00,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:52:00,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:52:00,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:52:00,930 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:52:00,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:52:00,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:52:00,931 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:52:00,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:52:00,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:52:00,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:52:00,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:52:00,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:52:00,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:52:00,936 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:52:00,936 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:52:00,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:52:00,937 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:52:00,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:52:00,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:52:00,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:52:00,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:52:00,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:52:00,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:52:00,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:52:00,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:52:00,940 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:52:00,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:52:00,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:52:00,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:52:00,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:52:00,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:52:00,942 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 -> 7a5e3c5868bad164e21cd0fc02186c2fb27c3de8083d1633d4818509bd4b4b8d [2024-10-11 08:52:01,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:52:01,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:52:01,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:52:01,248 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:52:01,249 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:52:01,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i [2024-10-11 08:52:02,860 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:52:03,124 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:52:03,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i [2024-10-11 08:52:03,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cf3310eac/af0d1b37d2da4524a71851c41376352b/FLAG53db93a94 [2024-10-11 08:52:03,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cf3310eac/af0d1b37d2da4524a71851c41376352b [2024-10-11 08:52:03,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:52:03,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:52:03,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:52:03,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:52:03,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:52:03,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:52:03" (1/1) ... [2024-10-11 08:52:03,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce69e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:03, skipping insertion in model container [2024-10-11 08:52:03,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:52:03" (1/1) ... [2024-10-11 08:52:03,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:52:03,399 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i[919,932] [2024-10-11 08:52:03,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:52:03,487 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:52:03,500 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i[919,932] [2024-10-11 08:52:03,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:52:03,578 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:52:03,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:03 WrapperNode [2024-10-11 08:52:03,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:52:03,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:52:03,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:52:03,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:52:03,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:03" (1/1) ... [2024-10-11 08:52:03,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:03" (1/1) ... [2024-10-11 08:52:03,657 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-10-11 08:52:03,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:52:03,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:52:03,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:52:03,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:52:03,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:03" (1/1) ... [2024-10-11 08:52:03,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:03" (1/1) ... [2024-10-11 08:52:03,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:03" (1/1) ... [2024-10-11 08:52:03,713 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 08:52:03,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:03" (1/1) ... [2024-10-11 08:52:03,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:03" (1/1) ... [2024-10-11 08:52:03,725 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:03" (1/1) ... [2024-10-11 08:52:03,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:03" (1/1) ... [2024-10-11 08:52:03,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:03" (1/1) ... [2024-10-11 08:52:03,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:03" (1/1) ... [2024-10-11 08:52:03,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:52:03,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:52:03,751 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:52:03,751 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:52:03,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:03" (1/1) ... [2024-10-11 08:52:03,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:52:03,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:52:03,796 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 08:52:03,800 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 08:52:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:52:03,862 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:52:03,862 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:52:03,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:52:03,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:52:03,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:52:03,986 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:52:03,990 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:52:04,394 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-11 08:52:04,394 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:52:04,453 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:52:04,457 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:52:04,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:52:04 BoogieIcfgContainer [2024-10-11 08:52:04,458 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:52:04,460 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:52:04,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:52:04,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:52:04,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:52:03" (1/3) ... [2024-10-11 08:52:04,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d8fb56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:52:04, skipping insertion in model container [2024-10-11 08:52:04,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:03" (2/3) ... [2024-10-11 08:52:04,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d8fb56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:52:04, skipping insertion in model container [2024-10-11 08:52:04,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:52:04" (3/3) ... [2024-10-11 08:52:04,470 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i [2024-10-11 08:52:04,485 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:52:04,485 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:52:04,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:52:04,562 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;@129e8407, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:52:04,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:52:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 57 states have internal predecessors, (87), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 08:52:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 08:52:04,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:04,589 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:04,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:04,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:04,599 INFO L85 PathProgramCache]: Analyzing trace with hash -177386306, now seen corresponding path program 1 times [2024-10-11 08:52:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:04,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682014571] [2024-10-11 08:52:04,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:04,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:52:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:52:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:52:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:52:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:52:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:52:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:52:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 08:52:05,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:05,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682014571] [2024-10-11 08:52:05,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682014571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:05,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:05,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:52:05,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125073645] [2024-10-11 08:52:05,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:05,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:52:05,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:05,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:52:05,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:52:05,389 INFO L87 Difference]: Start difference. First operand has 83 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 57 states have internal predecessors, (87), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 08:52:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:05,498 INFO L93 Difference]: Finished difference Result 240 states and 443 transitions. [2024-10-11 08:52:05,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:52:05,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-10-11 08:52:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:05,518 INFO L225 Difference]: With dead ends: 240 [2024-10-11 08:52:05,518 INFO L226 Difference]: Without dead ends: 158 [2024-10-11 08:52:05,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:52:05,531 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 112 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:05,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 316 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:52:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-11 08:52:05,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 97. [2024-10-11 08:52:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 71 states have internal predecessors, (107), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 08:52:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 155 transitions. [2024-10-11 08:52:05,590 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 155 transitions. Word has length 153 [2024-10-11 08:52:05,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:05,592 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 155 transitions. [2024-10-11 08:52:05,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 08:52:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 155 transitions. [2024-10-11 08:52:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 08:52:05,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:05,599 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:05,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:52:05,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:05,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:05,600 INFO L85 PathProgramCache]: Analyzing trace with hash -120128004, now seen corresponding path program 1 times [2024-10-11 08:52:05,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:05,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421184937] [2024-10-11 08:52:05,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:05,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:52:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:52:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:52:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:52:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:52:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:52:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:52:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 08:52:05,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:05,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421184937] [2024-10-11 08:52:05,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421184937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:05,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:05,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:52:05,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734095303] [2024-10-11 08:52:05,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:05,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:52:05,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:05,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:52:05,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:52:05,965 INFO L87 Difference]: Start difference. First operand 97 states and 155 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 08:52:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:06,172 INFO L93 Difference]: Finished difference Result 261 states and 416 transitions. [2024-10-11 08:52:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:52:06,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-10-11 08:52:06,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:06,175 INFO L225 Difference]: With dead ends: 261 [2024-10-11 08:52:06,175 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 08:52:06,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:52:06,183 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 71 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:06,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 377 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:52:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 08:52:06,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2024-10-11 08:52:06,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 127 states have (on average 1.5275590551181102) internal successors, (194), 128 states have internal predecessors, (194), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 08:52:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 258 transitions. [2024-10-11 08:52:06,211 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 258 transitions. Word has length 153 [2024-10-11 08:52:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:06,211 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 258 transitions. [2024-10-11 08:52:06,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 08:52:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 258 transitions. [2024-10-11 08:52:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 08:52:06,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:06,215 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:06,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:52:06,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:06,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:06,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1550046021, now seen corresponding path program 1 times [2024-10-11 08:52:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:06,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279985983] [2024-10-11 08:52:06,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:52:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:52:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:52:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:52:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:52:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:52:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:52:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-11 08:52:07,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:07,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279985983] [2024-10-11 08:52:07,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279985983] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:52:07,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395939865] [2024-10-11 08:52:07,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:07,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:52:07,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:52:07,224 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 08:52:07,227 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 08:52:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:07,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 08:52:07,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:52:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 465 proven. 18 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-10-11 08:52:07,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:52:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 51 proven. 18 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-11 08:52:08,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395939865] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:52:08,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:52:08,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 18 [2024-10-11 08:52:08,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228515615] [2024-10-11 08:52:08,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:52:08,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 08:52:08,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:08,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 08:52:08,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-10-11 08:52:08,347 INFO L87 Difference]: Start difference. First operand 162 states and 258 transitions. Second operand has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2024-10-11 08:52:10,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:10,742 INFO L93 Difference]: Finished difference Result 698 states and 1030 transitions. [2024-10-11 08:52:10,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-10-11 08:52:10,743 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) Word has length 154 [2024-10-11 08:52:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:10,753 INFO L225 Difference]: With dead ends: 698 [2024-10-11 08:52:10,754 INFO L226 Difference]: Without dead ends: 537 [2024-10-11 08:52:10,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1893 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1165, Invalid=4687, Unknown=0, NotChecked=0, Total=5852 [2024-10-11 08:52:10,761 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 715 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:10,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 646 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 08:52:10,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-10-11 08:52:10,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 271. [2024-10-11 08:52:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 193 states have (on average 1.3471502590673574) internal successors, (260), 195 states have internal predecessors, (260), 64 states have call successors, (64), 13 states have call predecessors, (64), 13 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 08:52:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 388 transitions. [2024-10-11 08:52:10,827 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 388 transitions. Word has length 154 [2024-10-11 08:52:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:10,829 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 388 transitions. [2024-10-11 08:52:10,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2024-10-11 08:52:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 388 transitions. [2024-10-11 08:52:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 08:52:10,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:10,834 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:10,854 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 08:52:11,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:52:11,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:11,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:11,036 INFO L85 PathProgramCache]: Analyzing trace with hash -991853403, now seen corresponding path program 1 times [2024-10-11 08:52:11,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:11,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928534081] [2024-10-11 08:52:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:11,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:52:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:52:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:52:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:52:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:52:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:52:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:52:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 08:52:11,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:11,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928534081] [2024-10-11 08:52:11,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928534081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:11,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:11,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:52:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698531558] [2024-10-11 08:52:11,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:11,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:52:11,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:11,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:52:11,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:52:11,413 INFO L87 Difference]: Start difference. First operand 271 states and 388 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 08:52:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:11,605 INFO L93 Difference]: Finished difference Result 563 states and 810 transitions. [2024-10-11 08:52:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:52:11,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2024-10-11 08:52:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:11,612 INFO L225 Difference]: With dead ends: 563 [2024-10-11 08:52:11,612 INFO L226 Difference]: Without dead ends: 420 [2024-10-11 08:52:11,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:52:11,614 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 85 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:11,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 426 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:52:11,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-11 08:52:11,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 330. [2024-10-11 08:52:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 223 states have (on average 1.3004484304932735) internal successors, (290), 225 states have internal predecessors, (290), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-11 08:52:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 466 transitions. [2024-10-11 08:52:11,695 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 466 transitions. Word has length 156 [2024-10-11 08:52:11,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:11,695 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 466 transitions. [2024-10-11 08:52:11,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 08:52:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 466 transitions. [2024-10-11 08:52:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 08:52:11,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:11,698 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:11,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:52:11,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:11,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:11,701 INFO L85 PathProgramCache]: Analyzing trace with hash 589933554, now seen corresponding path program 1 times [2024-10-11 08:52:11,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:11,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828853587] [2024-10-11 08:52:11,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:11,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:52:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:52:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:52:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:52:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:52:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:52:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:52:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:52:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:52:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:52:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:52:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:52:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:52:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:52:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:52:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:52:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:52:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 63 proven. 69 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-10-11 08:52:12,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:12,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828853587] [2024-10-11 08:52:12,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828853587] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:52:12,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716488731] [2024-10-11 08:52:12,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:12,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:52:12,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:52:12,333 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 08:52:12,339 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 08:52:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:12,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 08:52:12,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:52:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 726 proven. 69 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-11 08:52:13,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:52:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-11 08:52:13,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716488731] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:52:13,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:52:13,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 26 [2024-10-11 08:52:13,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648141712] [2024-10-11 08:52:13,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:52:13,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 08:52:13,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:13,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 08:52:13,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2024-10-11 08:52:13,885 INFO L87 Difference]: Start difference. First operand 330 states and 466 transitions. Second operand has 26 states, 25 states have (on average 4.84) internal successors, (121), 26 states have internal predecessors, (121), 10 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 9 states have call predecessors, (72), 10 states have call successors, (72) [2024-10-11 08:52:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:15,812 INFO L93 Difference]: Finished difference Result 783 states and 1077 transitions. [2024-10-11 08:52:15,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-11 08:52:15,813 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.84) internal successors, (121), 26 states have internal predecessors, (121), 10 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 9 states have call predecessors, (72), 10 states have call successors, (72) Word has length 156 [2024-10-11 08:52:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:15,820 INFO L225 Difference]: With dead ends: 783 [2024-10-11 08:52:15,820 INFO L226 Difference]: Without dead ends: 513 [2024-10-11 08:52:15,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=892, Invalid=3268, Unknown=0, NotChecked=0, Total=4160 [2024-10-11 08:52:15,825 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 863 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:15,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 744 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [465 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 08:52:15,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-10-11 08:52:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 355. [2024-10-11 08:52:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 242 states have (on average 1.2727272727272727) internal successors, (308), 244 states have internal predecessors, (308), 88 states have call successors, (88), 24 states have call predecessors, (88), 24 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-11 08:52:15,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 484 transitions. [2024-10-11 08:52:15,893 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 484 transitions. Word has length 156 [2024-10-11 08:52:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:15,894 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 484 transitions. [2024-10-11 08:52:15,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.84) internal successors, (121), 26 states have internal predecessors, (121), 10 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 9 states have call predecessors, (72), 10 states have call successors, (72) [2024-10-11 08:52:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 484 transitions. [2024-10-11 08:52:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 08:52:15,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:15,898 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:15,917 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 08:52:16,099 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 08:52:16,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:16,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:16,100 INFO L85 PathProgramCache]: Analyzing trace with hash -230893130, now seen corresponding path program 1 times [2024-10-11 08:52:16,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:16,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87883818] [2024-10-11 08:52:16,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:16,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:52:16,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:52:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:52:16,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:52:16,501 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:52:16,502 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:52:16,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 08:52:16,508 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 08:52:16,628 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:52:16,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:52:16 BoogieIcfgContainer [2024-10-11 08:52:16,632 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:52:16,633 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:52:16,633 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:52:16,633 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:52:16,633 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:52:04" (3/4) ... [2024-10-11 08:52:16,635 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:52:16,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:52:16,637 INFO L158 Benchmark]: Toolchain (without parser) took 13479.11ms. Allocated memory was 144.7MB in the beginning and 302.0MB in the end (delta: 157.3MB). Free memory was 89.6MB in the beginning and 204.1MB in the end (delta: -114.5MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2024-10-11 08:52:16,637 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 144.7MB. Free memory was 105.8MB in the beginning and 105.6MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:52:16,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.36ms. Allocated memory is still 144.7MB. Free memory was 89.3MB in the beginning and 73.4MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 08:52:16,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.05ms. Allocated memory is still 144.7MB. Free memory was 73.0MB in the beginning and 70.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:52:16,638 INFO L158 Benchmark]: Boogie Preprocessor took 91.63ms. Allocated memory is still 144.7MB. Free memory was 70.4MB in the beginning and 67.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 08:52:16,638 INFO L158 Benchmark]: RCFGBuilder took 707.53ms. Allocated memory is still 144.7MB. Free memory was 67.2MB in the beginning and 93.6MB in the end (delta: -26.4MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-10-11 08:52:16,642 INFO L158 Benchmark]: TraceAbstraction took 12171.76ms. Allocated memory was 144.7MB in the beginning and 302.0MB in the end (delta: 157.3MB). Free memory was 93.6MB in the beginning and 205.1MB in the end (delta: -111.5MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-10-11 08:52:16,642 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 302.0MB. Free memory is still 204.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:52:16,643 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.20ms. Allocated memory is still 144.7MB. Free memory was 105.8MB in the beginning and 105.6MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.36ms. Allocated memory is still 144.7MB. Free memory was 89.3MB in the beginning and 73.4MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.05ms. Allocated memory is still 144.7MB. Free memory was 73.0MB in the beginning and 70.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.63ms. Allocated memory is still 144.7MB. Free memory was 70.4MB in the beginning and 67.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 707.53ms. Allocated memory is still 144.7MB. Free memory was 67.2MB in the beginning and 93.6MB in the end (delta: -26.4MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12171.76ms. Allocated memory was 144.7MB in the beginning and 302.0MB in the end (delta: 157.3MB). Free memory was 93.6MB in the beginning and 205.1MB in the end (delta: -111.5MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 302.0MB. Free memory is still 204.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 170, overapproximation of someUnaryDOUBLEoperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 184, overapproximation of someBinaryArithmeticFLOAToperation at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed char var_1_7 = 0; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 4; [L29] unsigned long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 1422462314; [L31] signed short int var_1_12 = 8; [L32] signed short int var_1_15 = -50; [L33] unsigned long int var_1_16 = 1; [L34] unsigned long int var_1_17 = 3609236770; [L35] unsigned long int var_1_18 = 2902762324; [L36] double var_1_19 = 3.8; [L37] double var_1_20 = 255.75; [L38] unsigned short int var_1_21 = 0; [L39] signed char var_1_22 = -8; [L40] signed long int var_1_23 = -32; [L41] unsigned char var_1_25 = 10; [L42] unsigned char var_1_27 = 128; [L43] float var_1_30 = 31.3; [L44] float var_1_32 = 15.25; [L45] double var_1_33 = 128.8; [L46] signed char var_1_34 = 4; [L47] signed char var_1_35 = 1; [L48] unsigned char var_1_36 = 16; [L49] unsigned long int last_1_var_1_10 = 128; [L50] unsigned long int last_1_var_1_16 = 1; [L51] double last_1_var_1_19 = 3.8; [L188] isInitial = 1 [L189] FCALL initially() [L190] COND TRUE 1 [L191] CALL updateLastVariables() [L179] last_1_var_1_10 = var_1_10 [L180] last_1_var_1_16 = var_1_16 [L181] last_1_var_1_19 = var_1_19 [L191] RET updateLastVariables() [L192] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L145] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L145] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L146] var_1_7 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L147] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L148] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L148] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L149] var_1_8 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L150] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L151] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L151] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L152] var_1_9 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L153] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L154] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L155] var_1_11 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L156] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L157] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L158] var_1_17 = __VERIFIER_nondet_ulong() [L159] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L159] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L160] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L161] var_1_18 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L162] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L163] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L164] var_1_20 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L165] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L166] var_1_27 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L167] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L168] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L168] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L169] var_1_32 = __VERIFIER_nondet_float() [L170] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L170] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L171] var_1_34 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L172] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L173] CALL assume_abort_if_not(var_1_34 <= 5) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L173] RET assume_abort_if_not(var_1_34 <= 5) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L174] var_1_35 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L175] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L176] CALL assume_abort_if_not(var_1_35 <= 4) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L176] RET assume_abort_if_not(var_1_35 <= 4) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L192] RET updateVariables() [L193] CALL step() [L55] unsigned long int stepLocal_1 = last_1_var_1_16; [L56] unsigned long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L57] COND TRUE stepLocal_1 != last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L58] COND FALSE !(var_1_8 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L66] COND TRUE var_1_12 == var_1_12 [L67] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L69] var_1_1 = (var_1_2 || (! var_1_3)) [L70] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L71] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L72] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L73] COND FALSE !(var_1_19 >= var_1_19) [L78] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L83] COND TRUE var_1_19 != var_1_19 [L84] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L92] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_2=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L93] COND FALSE !((var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L96] var_1_22 = ((((-25) < 0 ) ? -(-25) : (-25))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L97] COND FALSE !(var_1_7 > var_1_12) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L104] EXPR var_1_12 >> var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L104] EXPR ((var_1_9) < ((var_1_12 >> var_1_7))) ? (var_1_9) : ((var_1_12 >> var_1_7)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L104] COND FALSE !(var_1_18 <= ((((var_1_9) < ((var_1_12 >> var_1_7))) ? (var_1_9) : ((var_1_12 >> var_1_7))))) [L107] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L111] COND TRUE \read(var_1_1) [L112] var_1_30 = ((((var_1_20) < ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32)))))) ? (var_1_20) : ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))))))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L114] COND FALSE !(var_1_9 >= var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L127] COND TRUE var_1_27 >= (var_1_9 + var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L128] COND TRUE (-0.95f * ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > var_1_20 [L129] var_1_36 = (var_1_27 - var_1_35) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L193] RET step() [L194] CALL, EXPR property() [L184-L185] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_12 == var_1_12) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((last_1_var_1_16 != last_1_var_1_10) ? ((var_1_8 <= last_1_var_1_16) ? (((- last_1_var_1_19) >= last_1_var_1_19) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_1 ? ((var_1_19 >= var_1_19) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_19 != var_1_19) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_4 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_16 == (var_1_8 - var_1_9)) && var_1_1) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; [L194] RET, EXPR property() [L194] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1853 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1846 mSDsluCounter, 2509 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1887 mSDsCounter, 808 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2554 IncrementalHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 808 mSolverCounterUnsat, 622 mSDtfsCounter, 2554 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1002 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3063 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=355occurred in iteration=5, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 578 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1239 NumberOfCodeBlocks, 1239 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1383 ConstructedInterpolants, 0 QuantifiedInterpolants, 4929 SizeOfPredicates, 10 NumberOfNonLiveVariables, 744 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 9630/9936 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 08:52:16,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_fillercode_fillercodestructure_filler-pe-ci_file-11.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 7a5e3c5868bad164e21cd0fc02186c2fb27c3de8083d1633d4818509bd4b4b8d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:52:19,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:52:19,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:52:19,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:52:19,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:52:19,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:52:19,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:52:19,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:52:19,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:52:19,173 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:52:19,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:52:19,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:52:19,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:52:19,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:52:19,177 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:52:19,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:52:19,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:52:19,178 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:52:19,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:52:19,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:52:19,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:52:19,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:52:19,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:52:19,184 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:52:19,184 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:52:19,184 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:52:19,185 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:52:19,185 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:52:19,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:52:19,185 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:52:19,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:52:19,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:52:19,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:52:19,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:52:19,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:52:19,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:52:19,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:52:19,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:52:19,196 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:52:19,196 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:52:19,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:52:19,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:52:19,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:52:19,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:52:19,198 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:52:19,198 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 -> 7a5e3c5868bad164e21cd0fc02186c2fb27c3de8083d1633d4818509bd4b4b8d [2024-10-11 08:52:19,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:52:19,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:52:19,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:52:19,575 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:52:19,576 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:52:19,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i [2024-10-11 08:52:21,260 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:52:21,498 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:52:21,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i [2024-10-11 08:52:21,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9f97e53df/748a66792d504b1c9a3678c44293afb9/FLAG07be8c547 [2024-10-11 08:52:21,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9f97e53df/748a66792d504b1c9a3678c44293afb9 [2024-10-11 08:52:21,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:52:21,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:52:21,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:52:21,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:52:21,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:52:21,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:52:21" (1/1) ... [2024-10-11 08:52:21,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2104f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:21, skipping insertion in model container [2024-10-11 08:52:21,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:52:21" (1/1) ... [2024-10-11 08:52:21,569 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:52:21,765 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i[919,932] [2024-10-11 08:52:21,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:52:21,869 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:52:21,882 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i[919,932] [2024-10-11 08:52:21,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:52:21,966 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:52:21,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:21 WrapperNode [2024-10-11 08:52:21,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:52:21,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:52:21,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:52:21,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:52:21,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:21" (1/1) ... [2024-10-11 08:52:21,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:21" (1/1) ... [2024-10-11 08:52:22,032 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-10-11 08:52:22,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:52:22,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:52:22,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:52:22,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:52:22,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:21" (1/1) ... [2024-10-11 08:52:22,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:21" (1/1) ... [2024-10-11 08:52:22,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:21" (1/1) ... [2024-10-11 08:52:22,081 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 08:52:22,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:21" (1/1) ... [2024-10-11 08:52:22,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:21" (1/1) ... [2024-10-11 08:52:22,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:21" (1/1) ... [2024-10-11 08:52:22,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:21" (1/1) ... [2024-10-11 08:52:22,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:21" (1/1) ... [2024-10-11 08:52:22,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:21" (1/1) ... [2024-10-11 08:52:22,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:52:22,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:52:22,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:52:22,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:52:22,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:21" (1/1) ... [2024-10-11 08:52:22,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:52:22,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:52:22,163 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 08:52:22,167 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 08:52:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:52:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:52:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:52:22,206 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:52:22,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:52:22,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:52:22,316 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:52:22,319 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:52:24,859 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 08:52:24,859 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:52:24,904 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:52:24,904 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:52:24,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:52:24 BoogieIcfgContainer [2024-10-11 08:52:24,905 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:52:24,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:52:24,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:52:24,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:52:24,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:52:21" (1/3) ... [2024-10-11 08:52:24,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d22badd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:52:24, skipping insertion in model container [2024-10-11 08:52:24,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:21" (2/3) ... [2024-10-11 08:52:24,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d22badd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:52:24, skipping insertion in model container [2024-10-11 08:52:24,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:52:24" (3/3) ... [2024-10-11 08:52:24,917 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i [2024-10-11 08:52:24,936 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:52:24,936 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:52:25,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:52:25,020 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;@2ae2a52c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:52:25,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:52:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 48 states have (on average 1.5625) internal successors, (75), 49 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 08:52:25,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 08:52:25,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:25,043 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:25,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:25,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash -971117491, now seen corresponding path program 1 times [2024-10-11 08:52:25,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:52:25,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260052683] [2024-10-11 08:52:25,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:25,066 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 08:52:25,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:52:25,069 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 08:52:25,083 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 08:52:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:25,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:52:25,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:52:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-10-11 08:52:25,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:52:25,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:52:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260052683] [2024-10-11 08:52:25,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260052683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:25,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:25,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:52:25,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186150171] [2024-10-11 08:52:25,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:25,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:52:25,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:52:25,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:52:25,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:52:25,508 INFO L87 Difference]: Start difference. First operand has 75 states, 48 states have (on average 1.5625) internal successors, (75), 49 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 08:52:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:25,584 INFO L93 Difference]: Finished difference Result 147 states and 268 transitions. [2024-10-11 08:52:25,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:52:25,590 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 151 [2024-10-11 08:52:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:25,597 INFO L225 Difference]: With dead ends: 147 [2024-10-11 08:52:25,598 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 08:52:25,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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 08:52:25,605 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:25,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:52:25,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 08:52:25,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 08:52:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 08:52:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 116 transitions. [2024-10-11 08:52:25,658 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 116 transitions. Word has length 151 [2024-10-11 08:52:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:25,659 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 116 transitions. [2024-10-11 08:52:25,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 08:52:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 116 transitions. [2024-10-11 08:52:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 08:52:25,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:25,663 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:25,673 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 08:52:25,864 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 08:52:25,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:25,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:25,866 INFO L85 PathProgramCache]: Analyzing trace with hash -893796659, now seen corresponding path program 1 times [2024-10-11 08:52:25,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:52:25,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456945310] [2024-10-11 08:52:25,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:25,867 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 08:52:25,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:52:25,871 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 08:52:25,872 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 08:52:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:26,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:52:26,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:52:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 08:52:27,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:52:27,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:52:27,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456945310] [2024-10-11 08:52:27,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456945310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:27,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:27,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:52:27,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993889493] [2024-10-11 08:52:27,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:27,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:52:27,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:52:27,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:52:27,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:52:27,548 INFO L87 Difference]: Start difference. First operand 73 states and 116 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 08:52:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:28,070 INFO L93 Difference]: Finished difference Result 218 states and 347 transitions. [2024-10-11 08:52:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:52:28,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 151 [2024-10-11 08:52:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:28,078 INFO L225 Difference]: With dead ends: 218 [2024-10-11 08:52:28,078 INFO L226 Difference]: Without dead ends: 146 [2024-10-11 08:52:28,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:52:28,083 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 73 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:28,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 390 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 08:52:28,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-11 08:52:28,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 116. [2024-10-11 08:52:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 65 states have (on average 1.323076923076923) internal successors, (86), 65 states have internal predecessors, (86), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 08:52:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 182 transitions. [2024-10-11 08:52:28,143 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 182 transitions. Word has length 151 [2024-10-11 08:52:28,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:28,144 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 182 transitions. [2024-10-11 08:52:28,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 08:52:28,144 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 182 transitions. [2024-10-11 08:52:28,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 08:52:28,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:28,150 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:28,166 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 (3)] Ended with exit code 0 [2024-10-11 08:52:28,351 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 08:52:28,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:28,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:28,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1324150038, now seen corresponding path program 1 times [2024-10-11 08:52:28,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:52:28,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761291228] [2024-10-11 08:52:28,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:28,353 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 08:52:28,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:52:28,356 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 08:52:28,358 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 08:52:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 08:52:28,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:52:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2024-10-11 08:52:29,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:52:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-11 08:52:29,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:52:29,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761291228] [2024-10-11 08:52:29,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761291228] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:52:29,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:52:29,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-11 08:52:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233327858] [2024-10-11 08:52:29,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:52:29,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 08:52:29,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:52:29,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 08:52:29,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 08:52:29,507 INFO L87 Difference]: Start difference. First operand 116 states and 182 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-11 08:52:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:31,837 INFO L93 Difference]: Finished difference Result 204 states and 311 transitions. [2024-10-11 08:52:31,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 08:52:31,840 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 152 [2024-10-11 08:52:31,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:31,843 INFO L225 Difference]: With dead ends: 204 [2024-10-11 08:52:31,843 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 08:52:31,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-11 08:52:31,845 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 186 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:31,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 183 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 08:52:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 08:52:31,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2024-10-11 08:52:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 71 states have internal predecessors, (88), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 08:52:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2024-10-11 08:52:31,884 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 152 [2024-10-11 08:52:31,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:31,885 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2024-10-11 08:52:31,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-11 08:52:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2024-10-11 08:52:31,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 08:52:31,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:31,892 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:31,903 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 (4)] Ended with exit code 0 [2024-10-11 08:52:32,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 08:52:32,094 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:32,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:32,094 INFO L85 PathProgramCache]: Analyzing trace with hash 652521330, now seen corresponding path program 1 times [2024-10-11 08:52:32,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:52:32,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202633386] [2024-10-11 08:52:32,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:32,095 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 08:52:32,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:52:32,099 INFO L229 MonitoredProcess]: Starting monitored process 5 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 08:52:32,100 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 (5)] Waiting until timeout for monitored process [2024-10-11 08:52:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:32,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 08:52:32,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:52:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 08:52:32,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:52:32,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:52:32,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202633386] [2024-10-11 08:52:32,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202633386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:32,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:32,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:52:32,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514718162] [2024-10-11 08:52:32,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:32,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:52:32,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:52:32,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:52:32,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:52:32,703 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 08:52:35,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:35,655 INFO L93 Difference]: Finished difference Result 204 states and 304 transitions. [2024-10-11 08:52:35,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:52:35,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-10-11 08:52:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:35,661 INFO L225 Difference]: With dead ends: 204 [2024-10-11 08:52:35,661 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 08:52:35,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:52:35,663 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 98 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:35,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 228 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 08:52:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 08:52:35,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2024-10-11 08:52:35,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 08:52:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 181 transitions. [2024-10-11 08:52:35,697 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 181 transitions. Word has length 153 [2024-10-11 08:52:35,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:35,699 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 181 transitions. [2024-10-11 08:52:35,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 08:52:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2024-10-11 08:52:35,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 08:52:35,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:35,703 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:35,714 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 (5)] Forceful destruction successful, exit code 0 [2024-10-11 08:52:35,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 08:52:35,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:35,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:35,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1678123661, now seen corresponding path program 1 times [2024-10-11 08:52:35,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:52:35,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050935387] [2024-10-11 08:52:35,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:35,906 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 08:52:35,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:52:35,907 INFO L229 MonitoredProcess]: Starting monitored process 6 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 08:52:35,909 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 (6)] Waiting until timeout for monitored process [2024-10-11 08:52:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:36,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 08:52:36,124 INFO L278 TraceCheckSpWp]: Computing forward predicates...