./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:04:47,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:04:48,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:04:48,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:04:48,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:04:48,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:04:48,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:04:48,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:04:48,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:04:48,082 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:04:48,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:04:48,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:04:48,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:04:48,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:04:48,085 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:04:48,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:04:48,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:04:48,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:04:48,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:04:48,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:04:48,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:04:48,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:04:48,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:04:48,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:04:48,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:04:48,089 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:04:48,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:04:48,090 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:04:48,090 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:04:48,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:04:48,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:04:48,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:04:48,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:04:48,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:04:48,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:04:48,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:04:48,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:04:48,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:04:48,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:04:48,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:04:48,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:04:48,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:04:48,094 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb [2024-10-13 01:04:48,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:04:48,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:04:48,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:04:48,368 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:04:48,368 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:04:48,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2024-10-13 01:04:49,860 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:04:50,060 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:04:50,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2024-10-13 01:04:50,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2766c1145/90d5add6dbe9446b93cc755ec4d8322b/FLAG21c167d2f [2024-10-13 01:04:50,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2766c1145/90d5add6dbe9446b93cc755ec4d8322b [2024-10-13 01:04:50,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:04:50,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:04:50,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:04:50,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:04:50,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:04:50,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:04:50" (1/1) ... [2024-10-13 01:04:50,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f50b988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:04:50, skipping insertion in model container [2024-10-13 01:04:50,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:04:50" (1/1) ... [2024-10-13 01:04:50,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:04:50,291 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i[914,927] [2024-10-13 01:04:50,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:04:50,378 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:04:50,390 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i[914,927] [2024-10-13 01:04:50,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:04:50,430 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:04:50,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:04:50 WrapperNode [2024-10-13 01:04:50,431 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:04:50,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:04:50,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:04:50,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:04:50,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:04:50" (1/1) ... [2024-10-13 01:04:50,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:04:50" (1/1) ... [2024-10-13 01:04:50,528 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 235 [2024-10-13 01:04:50,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:04:50,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:04:50,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:04:50,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:04:50,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:04:50" (1/1) ... [2024-10-13 01:04:50,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:04:50" (1/1) ... [2024-10-13 01:04:50,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:04:50" (1/1) ... [2024-10-13 01:04:50,628 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-13 01:04:50,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:04:50" (1/1) ... [2024-10-13 01:04:50,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:04:50" (1/1) ... [2024-10-13 01:04:50,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:04:50" (1/1) ... [2024-10-13 01:04:50,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:04:50" (1/1) ... [2024-10-13 01:04:50,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:04:50" (1/1) ... [2024-10-13 01:04:50,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:04:50" (1/1) ... [2024-10-13 01:04:50,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:04:50,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:04:50,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:04:50,682 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:04:50,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:04:50" (1/1) ... [2024-10-13 01:04:50,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:04:50,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:04:50,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:04:50,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:04:50,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:04:50,770 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:04:50,770 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:04:50,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:04:50,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:04:50,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:04:50,856 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:04:50,858 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:04:51,262 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-13 01:04:51,262 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:04:51,295 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:04:51,295 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:04:51,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:04:51 BoogieIcfgContainer [2024-10-13 01:04:51,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:04:51,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:04:51,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:04:51,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:04:51,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:04:50" (1/3) ... [2024-10-13 01:04:51,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7c61b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:04:51, skipping insertion in model container [2024-10-13 01:04:51,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:04:50" (2/3) ... [2024-10-13 01:04:51,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7c61b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:04:51, skipping insertion in model container [2024-10-13 01:04:51,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:04:51" (3/3) ... [2024-10-13 01:04:51,302 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2024-10-13 01:04:51,315 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:04:51,316 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:04:51,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:04:51,374 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;@1a8ad50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:04:51,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:04:51,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 70 states have internal predecessors, (107), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 01:04:51,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-13 01:04:51,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:04:51,393 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:04:51,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:04:51,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:04:51,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1673253595, now seen corresponding path program 1 times [2024-10-13 01:04:51,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:04:51,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641634767] [2024-10-13 01:04:51,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:04:51,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:04:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:04:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:04:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:04:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:04:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:04:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:04:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:04:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:04:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:04:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:04:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:04:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:04:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:04:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:04:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:04:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:04:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:04:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:04:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:04:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:04:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:04:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:04:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:04:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:04:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:04:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:04:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:04:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:04:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:51,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 01:04:51,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:04:51,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641634767] [2024-10-13 01:04:51,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641634767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:04:51,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:04:51,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:04:51,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948378582] [2024-10-13 01:04:51,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:04:51,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:04:51,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:04:51,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:04:51,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:04:51,835 INFO L87 Difference]: Start difference. First operand has 100 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 70 states have internal predecessors, (107), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 01:04:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:04:51,881 INFO L93 Difference]: Finished difference Result 197 states and 352 transitions. [2024-10-13 01:04:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:04:51,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 177 [2024-10-13 01:04:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:04:51,892 INFO L225 Difference]: With dead ends: 197 [2024-10-13 01:04:51,893 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 01:04:51,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:04:51,903 INFO L432 NwaCegarLoop]: 154 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, 154 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-13 01:04:51,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:04:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 01:04:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-13 01:04:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 68 states have internal predecessors, (101), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 01:04:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 157 transitions. [2024-10-13 01:04:51,954 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 157 transitions. Word has length 177 [2024-10-13 01:04:51,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:04:51,954 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 157 transitions. [2024-10-13 01:04:51,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 01:04:51,955 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 157 transitions. [2024-10-13 01:04:51,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-13 01:04:51,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:04:51,996 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:04:51,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:04:51,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:04:51,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:04:51,997 INFO L85 PathProgramCache]: Analyzing trace with hash -927460841, now seen corresponding path program 1 times [2024-10-13 01:04:51,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:04:51,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049240271] [2024-10-13 01:04:51,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:04:51,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:04:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:04:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:04:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:04:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:04:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:04:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:04:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:04:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:04:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:04:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:04:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:04:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:04:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:04:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:04:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:04:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:04:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:04:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:04:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:04:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:04:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:04:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:04:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:04:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:04:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:04:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:04:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:04:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:04:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 01:04:52,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:04:52,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049240271] [2024-10-13 01:04:52,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049240271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:04:52,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:04:52,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:04:52,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568956676] [2024-10-13 01:04:52,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:04:52,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:04:52,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:04:52,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:04:52,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:04:52,597 INFO L87 Difference]: Start difference. First operand 98 states and 157 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 01:04:52,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:04:52,720 INFO L93 Difference]: Finished difference Result 292 states and 469 transitions. [2024-10-13 01:04:52,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:04:52,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-10-13 01:04:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:04:52,726 INFO L225 Difference]: With dead ends: 292 [2024-10-13 01:04:52,726 INFO L226 Difference]: Without dead ends: 195 [2024-10-13 01:04:52,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-13 01:04:52,728 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 95 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:04:52,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 303 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:04:52,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-13 01:04:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2024-10-13 01:04:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 134 states have (on average 1.462686567164179) internal successors, (196), 134 states have internal predecessors, (196), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 01:04:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 308 transitions. [2024-10-13 01:04:52,772 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 308 transitions. Word has length 177 [2024-10-13 01:04:52,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:04:52,772 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 308 transitions. [2024-10-13 01:04:52,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 01:04:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 308 transitions. [2024-10-13 01:04:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-13 01:04:52,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:04:52,780 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:04:52,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:04:52,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:04:52,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:04:52,786 INFO L85 PathProgramCache]: Analyzing trace with hash -373019630, now seen corresponding path program 1 times [2024-10-13 01:04:52,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:04:52,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479730334] [2024-10-13 01:04:52,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:04:52,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:04:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:04:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:04:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:04:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:04:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:04:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:04:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:04:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:04:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:04:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:04:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:04:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:04:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:04:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:04:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:04:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:04:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:04:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:04:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:04:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:04:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:04:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:04:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:04:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:04:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:04:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:04:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:04:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:04:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 01:04:52,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:04:52,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479730334] [2024-10-13 01:04:52,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479730334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:04:52,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:04:52,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:04:52,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028263832] [2024-10-13 01:04:52,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:04:52,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:04:52,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:04:52,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:04:52,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:04:52,999 INFO L87 Difference]: Start difference. First operand 193 states and 308 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 01:04:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:04:53,090 INFO L93 Difference]: Finished difference Result 445 states and 706 transitions. [2024-10-13 01:04:53,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:04:53,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-10-13 01:04:53,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:04:53,099 INFO L225 Difference]: With dead ends: 445 [2024-10-13 01:04:53,099 INFO L226 Difference]: Without dead ends: 253 [2024-10-13 01:04:53,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-13 01:04:53,101 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 39 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:04:53,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 328 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:04:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-13 01:04:53,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 211. [2024-10-13 01:04:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 152 states have (on average 1.4605263157894737) internal successors, (222), 152 states have internal predecessors, (222), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 01:04:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 334 transitions. [2024-10-13 01:04:53,134 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 334 transitions. Word has length 178 [2024-10-13 01:04:53,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:04:53,135 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 334 transitions. [2024-10-13 01:04:53,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 01:04:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 334 transitions. [2024-10-13 01:04:53,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-13 01:04:53,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:04:53,137 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:04:53,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:04:53,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:04:53,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:04:53,138 INFO L85 PathProgramCache]: Analyzing trace with hash 491660460, now seen corresponding path program 1 times [2024-10-13 01:04:53,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:04:53,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121892657] [2024-10-13 01:04:53,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:04:53,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:04:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:04:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:04:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:04:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:04:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:04:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:04:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:04:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:04:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:04:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:04:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:04:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:04:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:04:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:04:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:04:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:04:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:04:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:04:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:04:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:04:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:04:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:04:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:04:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:04:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:04:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:04:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:04:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:04:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 01:04:53,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:04:53,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121892657] [2024-10-13 01:04:53,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121892657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:04:53,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:04:53,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:04:53,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047863477] [2024-10-13 01:04:53,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:04:53,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:04:53,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:04:53,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:04:53,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:04:53,317 INFO L87 Difference]: Start difference. First operand 211 states and 334 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 01:04:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:04:53,400 INFO L93 Difference]: Finished difference Result 623 states and 990 transitions. [2024-10-13 01:04:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:04:53,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-10-13 01:04:53,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:04:53,407 INFO L225 Difference]: With dead ends: 623 [2024-10-13 01:04:53,407 INFO L226 Difference]: Without dead ends: 413 [2024-10-13 01:04:53,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-13 01:04:53,412 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 143 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:04:53,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 421 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:04:53,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-13 01:04:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2024-10-13 01:04:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 294 states have (on average 1.4489795918367347) internal successors, (426), 294 states have internal predecessors, (426), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-13 01:04:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 650 transitions. [2024-10-13 01:04:53,460 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 650 transitions. Word has length 178 [2024-10-13 01:04:53,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:04:53,461 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 650 transitions. [2024-10-13 01:04:53,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 01:04:53,462 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 650 transitions. [2024-10-13 01:04:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-13 01:04:53,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:04:53,463 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:04:53,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 01:04:53,464 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:04:53,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:04:53,464 INFO L85 PathProgramCache]: Analyzing trace with hash 232658791, now seen corresponding path program 1 times [2024-10-13 01:04:53,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:04:53,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488890557] [2024-10-13 01:04:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:04:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:04:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:04:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:04:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:04:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:04:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:04:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:04:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:04:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:04:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:04:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:04:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:04:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:04:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:04:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:04:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:04:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:04:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:04:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:04:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:04:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:04:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:04:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:04:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:04:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:04:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:04:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:04:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:04:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:04:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 01:04:53,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:04:53,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488890557] [2024-10-13 01:04:53,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488890557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:04:53,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:04:53,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 01:04:53,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188682020] [2024-10-13 01:04:53,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:04:53,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 01:04:53,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:04:53,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 01:04:53,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 01:04:53,756 INFO L87 Difference]: Start difference. First operand 411 states and 650 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 01:04:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:04:54,169 INFO L93 Difference]: Finished difference Result 1031 states and 1632 transitions. [2024-10-13 01:04:54,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:04:54,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2024-10-13 01:04:54,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:04:54,174 INFO L225 Difference]: With dead ends: 1031 [2024-10-13 01:04:54,174 INFO L226 Difference]: Without dead ends: 825 [2024-10-13 01:04:54,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:04:54,176 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 103 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 01:04:54,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 652 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 01:04:54,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-13 01:04:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 817. [2024-10-13 01:04:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 584 states have (on average 1.452054794520548) internal successors, (848), 584 states have internal predecessors, (848), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2024-10-13 01:04:54,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1296 transitions. [2024-10-13 01:04:54,229 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1296 transitions. Word has length 179 [2024-10-13 01:04:54,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:04:54,230 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1296 transitions. [2024-10-13 01:04:54,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 01:04:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1296 transitions. [2024-10-13 01:04:54,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-13 01:04:54,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:04:54,232 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:04:54,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 01:04:54,232 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:04:54,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:04:54,232 INFO L85 PathProgramCache]: Analyzing trace with hash -672678381, now seen corresponding path program 1 times [2024-10-13 01:04:54,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:04:54,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35194176] [2024-10-13 01:04:54,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:04:54,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:04:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:04:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:04:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:04:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:04:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:04:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:04:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:04:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:04:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:04:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:04:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:04:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:04:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:04:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:04:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:04:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:04:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:04:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:04:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:04:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:04:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:04:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:04:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:04:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:04:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:04:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:04:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:04:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:04:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-13 01:04:55,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:04:55,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35194176] [2024-10-13 01:04:55,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35194176] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:04:55,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91236354] [2024-10-13 01:04:55,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:04:55,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:04:55,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:04:55,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:04:55,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 01:04:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:55,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 01:04:55,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:04:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 950 proven. 138 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-13 01:04:56,309 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:04:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 87 proven. 147 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked. [2024-10-13 01:04:57,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91236354] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:04:57,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:04:57,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 25 [2024-10-13 01:04:57,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280807354] [2024-10-13 01:04:57,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:04:57,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 01:04:57,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:04:57,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 01:04:57,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2024-10-13 01:04:57,434 INFO L87 Difference]: Start difference. First operand 817 states and 1296 transitions. Second operand has 25 states, 25 states have (on average 4.84) internal successors, (121), 25 states have internal predecessors, (121), 8 states have call successors, (70), 4 states have call predecessors, (70), 10 states have return successors, (72), 8 states have call predecessors, (72), 8 states have call successors, (72) [2024-10-13 01:04:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:04:58,627 INFO L93 Difference]: Finished difference Result 1521 states and 2330 transitions. [2024-10-13 01:04:58,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 01:04:58,628 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.84) internal successors, (121), 25 states have internal predecessors, (121), 8 states have call successors, (70), 4 states have call predecessors, (70), 10 states have return successors, (72), 8 states have call predecessors, (72), 8 states have call successors, (72) Word has length 179 [2024-10-13 01:04:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:04:58,632 INFO L225 Difference]: With dead ends: 1521 [2024-10-13 01:04:58,632 INFO L226 Difference]: Without dead ends: 705 [2024-10-13 01:04:58,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=650, Invalid=1606, Unknown=0, NotChecked=0, Total=2256 [2024-10-13 01:04:58,636 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1061 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 01:04:58,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 431 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 01:04:58,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-13 01:04:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 675. [2024-10-13 01:04:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 514 states have (on average 1.3968871595330739) internal successors, (718), 518 states have internal predecessors, (718), 136 states have call successors, (136), 24 states have call predecessors, (136), 24 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-13 01:04:58,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 990 transitions. [2024-10-13 01:04:58,686 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 990 transitions. Word has length 179 [2024-10-13 01:04:58,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:04:58,686 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 990 transitions. [2024-10-13 01:04:58,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.84) internal successors, (121), 25 states have internal predecessors, (121), 8 states have call successors, (70), 4 states have call predecessors, (70), 10 states have return successors, (72), 8 states have call predecessors, (72), 8 states have call successors, (72) [2024-10-13 01:04:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 990 transitions. [2024-10-13 01:04:58,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 01:04:58,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:04:58,688 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:04:58,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 01:04:58,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 01:04:58,889 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:04:58,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:04:58,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1950784254, now seen corresponding path program 1 times [2024-10-13 01:04:58,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:04:58,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133679830] [2024-10-13 01:04:58,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:04:58,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:04:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:04:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:04:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:04:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:04:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:04:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:04:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:04:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:04:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:04:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:04:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:04:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:04:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:04:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:04:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:04:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:04:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:04:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:04:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:04:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:04:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:04:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:04:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:04:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:04:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:04:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:04:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:04:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:04:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 01:04:59,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:04:59,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133679830] [2024-10-13 01:04:59,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133679830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:04:59,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:04:59,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 01:04:59,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146607303] [2024-10-13 01:04:59,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:04:59,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:04:59,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:04:59,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:04:59,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:04:59,064 INFO L87 Difference]: Start difference. First operand 675 states and 990 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 01:04:59,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:04:59,440 INFO L93 Difference]: Finished difference Result 1391 states and 2035 transitions. [2024-10-13 01:04:59,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:04:59,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-10-13 01:04:59,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:04:59,447 INFO L225 Difference]: With dead ends: 1391 [2024-10-13 01:04:59,447 INFO L226 Difference]: Without dead ends: 1221 [2024-10-13 01:04:59,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:04:59,449 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 154 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 01:04:59,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 520 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 01:04:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2024-10-13 01:04:59,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 977. [2024-10-13 01:04:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 736 states have (on average 1.3831521739130435) internal successors, (1018), 742 states have internal predecessors, (1018), 204 states have call successors, (204), 36 states have call predecessors, (204), 36 states have return successors, (204), 198 states have call predecessors, (204), 204 states have call successors, (204) [2024-10-13 01:04:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1426 transitions. [2024-10-13 01:04:59,519 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1426 transitions. Word has length 180 [2024-10-13 01:04:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:04:59,520 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1426 transitions. [2024-10-13 01:04:59,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 01:04:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1426 transitions. [2024-10-13 01:04:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 01:04:59,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:04:59,521 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:04:59,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 01:04:59,522 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:04:59,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:04:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash -111795528, now seen corresponding path program 1 times [2024-10-13 01:04:59,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:04:59,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286485114] [2024-10-13 01:04:59,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:04:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:04:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:04:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:04:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:04:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:04:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:04:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:04:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:04:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:04:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:04:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:04:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:04:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:04:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:04:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:04:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:04:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:04:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:04:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:04:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:04:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:04:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:04:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:04:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:04:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:04:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:04:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:04:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:04:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:04:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:04:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 01:04:59,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:04:59,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286485114] [2024-10-13 01:04:59,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286485114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:04:59,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:04:59,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 01:04:59,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346635940] [2024-10-13 01:04:59,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:04:59,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:04:59,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:04:59,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:04:59,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:04:59,841 INFO L87 Difference]: Start difference. First operand 977 states and 1426 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 01:05:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:05:00,147 INFO L93 Difference]: Finished difference Result 2130 states and 3121 transitions. [2024-10-13 01:05:00,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:05:00,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-10-13 01:05:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:05:00,156 INFO L225 Difference]: With dead ends: 2130 [2024-10-13 01:05:00,157 INFO L226 Difference]: Without dead ends: 1637 [2024-10-13 01:05:00,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:05:00,161 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 256 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:05:00,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 587 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:05:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2024-10-13 01:05:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1520. [2024-10-13 01:05:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1147 states have (on average 1.3888404533565823) internal successors, (1593), 1153 states have internal predecessors, (1593), 316 states have call successors, (316), 56 states have call predecessors, (316), 56 states have return successors, (316), 310 states have call predecessors, (316), 316 states have call successors, (316) [2024-10-13 01:05:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2225 transitions. [2024-10-13 01:05:00,295 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2225 transitions. Word has length 180 [2024-10-13 01:05:00,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:05:00,296 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 2225 transitions. [2024-10-13 01:05:00,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 01:05:00,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2225 transitions. [2024-10-13 01:05:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 01:05:00,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:05:00,302 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:05:00,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 01:05:00,302 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:05:00,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:05:00,302 INFO L85 PathProgramCache]: Analyzing trace with hash 120961033, now seen corresponding path program 1 times [2024-10-13 01:05:00,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:05:00,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066770288] [2024-10-13 01:05:00,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:05:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:05:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:05:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:05:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:05:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:05:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:05:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:05:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:05:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:05:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:05:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:05:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:05:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:05:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:05:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:05:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:05:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:05:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:05:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:05:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:05:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:05:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:05:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:05:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:05:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:05:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:05:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:05:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:05:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:05:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:00,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 01:05:00,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:05:00,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066770288] [2024-10-13 01:05:00,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066770288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:05:00,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:05:00,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 01:05:00,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951751269] [2024-10-13 01:05:00,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:05:00,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 01:05:00,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:05:00,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 01:05:00,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:05:00,589 INFO L87 Difference]: Start difference. First operand 1520 states and 2225 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 01:05:01,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:05:01,161 INFO L93 Difference]: Finished difference Result 3414 states and 4991 transitions. [2024-10-13 01:05:01,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 01:05:01,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2024-10-13 01:05:01,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:05:01,170 INFO L225 Difference]: With dead ends: 3414 [2024-10-13 01:05:01,171 INFO L226 Difference]: Without dead ends: 1895 [2024-10-13 01:05:01,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-10-13 01:05:01,177 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 521 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 01:05:01,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 656 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 01:05:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2024-10-13 01:05:01,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1875. [2024-10-13 01:05:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1422 states have (on average 1.3881856540084387) internal successors, (1974), 1430 states have internal predecessors, (1974), 384 states have call successors, (384), 68 states have call predecessors, (384), 68 states have return successors, (384), 376 states have call predecessors, (384), 384 states have call successors, (384) [2024-10-13 01:05:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2742 transitions. [2024-10-13 01:05:01,307 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2742 transitions. Word has length 180 [2024-10-13 01:05:01,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:05:01,307 INFO L471 AbstractCegarLoop]: Abstraction has 1875 states and 2742 transitions. [2024-10-13 01:05:01,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 01:05:01,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2742 transitions. [2024-10-13 01:05:01,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-13 01:05:01,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:05:01,309 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:05:01,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 01:05:01,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:05:01,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:05:01,310 INFO L85 PathProgramCache]: Analyzing trace with hash -157665694, now seen corresponding path program 1 times [2024-10-13 01:05:01,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:05:01,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454468173] [2024-10-13 01:05:01,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:05:01,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:05:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:05:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:05:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:05:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:05:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:05:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:05:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:05:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:05:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:05:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:05:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:05:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:05:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:05:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:05:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:05:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:05:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:05:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:05:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:05:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:05:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:05:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:05:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:05:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:05:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:05:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:05:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 01:05:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:05:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 01:05:01,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:05:01,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454468173] [2024-10-13 01:05:01,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454468173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:05:01,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:05:01,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 01:05:01,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463798091] [2024-10-13 01:05:01,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:05:01,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 01:05:01,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:05:01,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 01:05:01,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:05:01,670 INFO L87 Difference]: Start difference. First operand 1875 states and 2742 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 01:05:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:05:02,775 INFO L93 Difference]: Finished difference Result 2961 states and 4334 transitions. [2024-10-13 01:05:02,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 01:05:02,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2024-10-13 01:05:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:05:02,786 INFO L225 Difference]: With dead ends: 2961 [2024-10-13 01:05:02,786 INFO L226 Difference]: Without dead ends: 1971 [2024-10-13 01:05:02,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-10-13 01:05:02,790 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 347 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 01:05:02,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1125 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 01:05:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2024-10-13 01:05:02,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1873. [2024-10-13 01:05:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1420 states have (on average 1.3873239436619718) internal successors, (1970), 1428 states have internal predecessors, (1970), 384 states have call successors, (384), 68 states have call predecessors, (384), 68 states have return successors, (384), 376 states have call predecessors, (384), 384 states have call successors, (384) [2024-10-13 01:05:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2738 transitions. [2024-10-13 01:05:02,937 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2738 transitions. Word has length 181 [2024-10-13 01:05:02,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:05:02,937 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 2738 transitions. [2024-10-13 01:05:02,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 01:05:02,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2738 transitions. [2024-10-13 01:05:02,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-13 01:05:02,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:05:02,939 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:05:02,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 01:05:02,939 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:05:02,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:05:02,940 INFO L85 PathProgramCache]: Analyzing trace with hash 808171571, now seen corresponding path program 1 times [2024-10-13 01:05:02,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:05:02,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968617094] [2024-10-13 01:05:02,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:05:02,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:05:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:05:02,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1593319531] [2024-10-13 01:05:02,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:05:02,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:05:02,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:05:02,993 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:05:02,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 01:05:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:05:03,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 01:05:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:05:03,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 01:05:03,298 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 01:05:03,299 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 01:05:03,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 01:05:03,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 01:05:03,504 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:05:03,618 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 01:05:03,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:05:03 BoogieIcfgContainer [2024-10-13 01:05:03,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 01:05:03,622 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 01:05:03,622 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 01:05:03,622 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 01:05:03,623 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:04:51" (3/4) ... [2024-10-13 01:05:03,624 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 01:05:03,625 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 01:05:03,626 INFO L158 Benchmark]: Toolchain (without parser) took 13531.63ms. Allocated memory was 176.2MB in the beginning and 528.5MB in the end (delta: 352.3MB). Free memory was 104.0MB in the beginning and 216.7MB in the end (delta: -112.7MB). Peak memory consumption was 240.9MB. Max. memory is 16.1GB. [2024-10-13 01:05:03,626 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:05:03,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.75ms. Allocated memory is still 176.2MB. Free memory was 103.7MB in the beginning and 86.8MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 01:05:03,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.30ms. Allocated memory is still 176.2MB. Free memory was 86.8MB in the beginning and 144.4MB in the end (delta: -57.6MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-10-13 01:05:03,626 INFO L158 Benchmark]: Boogie Preprocessor took 141.19ms. Allocated memory is still 176.2MB. Free memory was 144.4MB in the beginning and 138.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 01:05:03,626 INFO L158 Benchmark]: RCFGBuilder took 617.31ms. Allocated memory is still 176.2MB. Free memory was 138.1MB in the beginning and 104.9MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-13 01:05:03,627 INFO L158 Benchmark]: TraceAbstraction took 12324.54ms. Allocated memory was 176.2MB in the beginning and 528.5MB in the end (delta: 352.3MB). Free memory was 103.7MB in the beginning and 217.8MB in the end (delta: -114.1MB). Peak memory consumption was 241.2MB. Max. memory is 16.1GB. [2024-10-13 01:05:03,627 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 528.5MB. Free memory is still 216.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:05:03,628 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.75ms. Allocated memory is still 176.2MB. Free memory was 103.7MB in the beginning and 86.8MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.30ms. Allocated memory is still 176.2MB. Free memory was 86.8MB in the beginning and 144.4MB in the end (delta: -57.6MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 141.19ms. Allocated memory is still 176.2MB. Free memory was 144.4MB in the beginning and 138.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 617.31ms. Allocated memory is still 176.2MB. Free memory was 138.1MB in the beginning and 104.9MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12324.54ms. Allocated memory was 176.2MB in the beginning and 528.5MB in the end (delta: 352.3MB). Free memory was 103.7MB in the beginning and 217.8MB in the end (delta: -114.1MB). Peak memory consumption was 241.2MB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 528.5MB. Free memory is still 216.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of bitwiseOr at line 111. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int var_1_24 = 5; [L38] unsigned short int var_1_25 = 2; [L39] unsigned short int var_1_26 = 1; [L40] unsigned short int var_1_27 = 64; [L41] signed long int var_1_28 = -4; [L42] unsigned long int var_1_29 = 10; [L43] unsigned char var_1_30 = 4; [L44] unsigned char var_1_31 = 16; [L45] signed long int var_1_32 = 8; [L46] float var_1_33 = 24.55; [L47] signed long int var_1_34 = 5; [L48] unsigned short int var_1_35 = 256; [L49] unsigned char var_1_36 = 0; [L50] unsigned long int last_1_var_1_10 = 256; [L51] unsigned char last_1_var_1_20 = 32; [L172] isInitial = 1 [L173] FCALL initially() [L174] COND TRUE 1 [L175] CALL updateLastVariables() [L164] last_1_var_1_10 = var_1_10 [L165] last_1_var_1_20 = var_1_20 [L175] RET updateLastVariables() [L176] CALL updateVariables() [L119] var_1_3 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_5=-32, var_1_6=256] [L120] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_5=-32, var_1_6=256] [L121] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L121] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L122] var_1_5 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L123] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L124] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L124] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L125] var_1_13 = __VERIFIER_nondet_char() [L126] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L126] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L127] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L127] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L128] var_1_14 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L129] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L130] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L130] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L131] var_1_15 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L132] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L133] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L133] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L134] var_1_16 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L135] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L136] var_1_21 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L137] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L138] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L138] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L139] var_1_22 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L140] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L141] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L141] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L142] var_1_25 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L143] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L144] CALL assume_abort_if_not(var_1_25 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L144] RET assume_abort_if_not(var_1_25 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L145] var_1_26 = __VERIFIER_nondet_ushort() [L146] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L146] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L147] CALL assume_abort_if_not(var_1_26 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L147] RET assume_abort_if_not(var_1_26 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L148] var_1_27 = __VERIFIER_nondet_ushort() [L149] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L149] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L150] CALL assume_abort_if_not(var_1_27 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L150] RET assume_abort_if_not(var_1_27 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L151] var_1_31 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L152] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L153] CALL assume_abort_if_not(var_1_31 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L153] RET assume_abort_if_not(var_1_31 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L154] var_1_33 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L155] RET assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L156] var_1_34 = __VERIFIER_nondet_long() [L157] CALL assume_abort_if_not(var_1_34 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L157] RET assume_abort_if_not(var_1_34 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L158] CALL assume_abort_if_not(var_1_34 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L158] RET assume_abort_if_not(var_1_34 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-62, var_1_6=256] [L159] var_1_36 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_3=0, var_1_5=-62, var_1_6=256] [L160] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_3=0, var_1_5=-62, var_1_6=256] [L161] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L161] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L176] RET updateVariables() [L177] CALL step() [L55] COND FALSE !(var_1_25 >= ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L58] var_1_28 = var_1_27 [L59] var_1_29 = var_1_26 [L60] var_1_30 = var_1_31 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L61] COND FALSE !(((((1.25f) < 0 ) ? -(1.25f) : (1.25f))) != var_1_33) [L68] var_1_32 = var_1_30 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L70] COND TRUE \read(var_1_36) [L71] var_1_35 = ((((var_1_30) > (((((128) < 0 ) ? -(128) : (128))))) ? (var_1_30) : (((((128) < 0 ) ? -(128) : (128)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L73] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L78] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-7874, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L79] COND TRUE stepLocal_2 > last_1_var_1_10 [L80] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L82] COND TRUE (((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L83] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L87] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=62, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L88] COND FALSE !(stepLocal_1 || var_1_3) [L93] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=62, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L95] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=62, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L106] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=62, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L111] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=62, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L111] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L112] COND FALSE !(var_1_20 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=62, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L177] RET step() [L178] CALL, EXPR property() [L168] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=62, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L168-L169] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L178] RET, EXPR property() [L178] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=62, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=62, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=67, var_1_21=384, var_1_22=-197, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=-65535, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-62, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 11, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2719 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2719 mSDsluCounter, 5177 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3296 mSDsCounter, 867 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1876 IncrementalHoareTripleChecker+Invalid, 2743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 867 mSolverCounterUnsat, 1881 mSDtfsCounter, 1876 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1043 GetRequests, 953 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1875occurred in iteration=9, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 563 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2330 NumberOfCodeBlocks, 2330 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2135 ConstructedInterpolants, 0 QuantifiedInterpolants, 8968 SizeOfPredicates, 7 NumberOfNonLiveVariables, 409 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 17820/18144 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-13 01:05:03,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:05:05,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:05:05,967 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 01:05:05,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:05:05,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:05:06,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:05:06,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:05:06,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:05:06,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:05:06,002 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:05:06,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:05:06,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:05:06,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:05:06,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:05:06,006 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:05:06,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:05:06,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:05:06,007 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:05:06,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:05:06,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:05:06,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:05:06,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:05:06,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:05:06,011 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 01:05:06,011 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 01:05:06,011 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:05:06,011 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 01:05:06,012 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:05:06,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:05:06,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:05:06,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:05:06,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:05:06,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:05:06,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:05:06,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:05:06,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:05:06,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:05:06,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:05:06,013 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 01:05:06,013 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 01:05:06,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:05:06,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:05:06,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:05:06,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:05:06,016 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 01:05:06,016 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb [2024-10-13 01:05:06,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:05:06,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:05:06,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:05:06,332 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:05:06,333 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:05:06,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2024-10-13 01:05:07,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:05:08,042 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:05:08,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2024-10-13 01:05:08,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98fcb0fc4/ceb55a826c66448cbb95d882589f6516/FLAG838c395d2 [2024-10-13 01:05:08,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98fcb0fc4/ceb55a826c66448cbb95d882589f6516 [2024-10-13 01:05:08,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:05:08,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:05:08,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:05:08,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:05:08,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:05:08,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:05:08" (1/1) ... [2024-10-13 01:05:08,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f33cd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:08, skipping insertion in model container [2024-10-13 01:05:08,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:05:08" (1/1) ... [2024-10-13 01:05:08,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:05:08,286 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i[914,927] [2024-10-13 01:05:08,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:05:08,369 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:05:08,378 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i[914,927] [2024-10-13 01:05:08,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:05:08,419 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:05:08,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:08 WrapperNode [2024-10-13 01:05:08,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:05:08,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:05:08,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:05:08,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:05:08,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:08" (1/1) ... [2024-10-13 01:05:08,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:08" (1/1) ... [2024-10-13 01:05:08,479 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-10-13 01:05:08,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:05:08,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:05:08,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:05:08,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:05:08,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:08" (1/1) ... [2024-10-13 01:05:08,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:08" (1/1) ... [2024-10-13 01:05:08,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:08" (1/1) ... [2024-10-13 01:05:08,532 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-13 01:05:08,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:08" (1/1) ... [2024-10-13 01:05:08,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:08" (1/1) ... [2024-10-13 01:05:08,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:08" (1/1) ... [2024-10-13 01:05:08,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:08" (1/1) ... [2024-10-13 01:05:08,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:08" (1/1) ... [2024-10-13 01:05:08,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:08" (1/1) ... [2024-10-13 01:05:08,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:05:08,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:05:08,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:05:08,573 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:05:08,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:08" (1/1) ... [2024-10-13 01:05:08,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:05:08,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:05:08,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:05:08,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:05:08,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:05:08,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 01:05:08,653 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:05:08,653 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:05:08,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:05:08,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:05:08,727 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:05:08,730 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:05:22,945 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 01:05:22,945 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:05:22,991 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:05:22,991 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:05:22,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:05:22 BoogieIcfgContainer [2024-10-13 01:05:22,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:05:22,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:05:22,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:05:23,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:05:23,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:05:08" (1/3) ... [2024-10-13 01:05:23,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28fd2184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:05:23, skipping insertion in model container [2024-10-13 01:05:23,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:08" (2/3) ... [2024-10-13 01:05:23,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28fd2184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:05:23, skipping insertion in model container [2024-10-13 01:05:23,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:05:22" (3/3) ... [2024-10-13 01:05:23,002 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2024-10-13 01:05:23,018 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:05:23,019 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:05:23,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:05:23,093 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;@1c6bdd18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:05:23,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:05:23,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 48 states have (on average 1.5) internal successors, (72), 49 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 01:05:23,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-13 01:05:23,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:05:23,113 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:05:23,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:05:23,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:05:23,118 INFO L85 PathProgramCache]: Analyzing trace with hash -480897107, now seen corresponding path program 1 times [2024-10-13 01:05:23,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:05:23,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446556053] [2024-10-13 01:05:23,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:05:23,132 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-13 01:05:23,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:05:23,135 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:05:23,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 01:05:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:24,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 01:05:24,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:05:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-10-13 01:05:24,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:05:24,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:05:24,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446556053] [2024-10-13 01:05:24,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446556053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:05:24,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:05:24,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:05:24,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878034408] [2024-10-13 01:05:24,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:05:24,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:05:24,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:05:24,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:05:24,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:05:24,377 INFO L87 Difference]: Start difference. First operand has 79 states, 48 states have (on average 1.5) internal successors, (72), 49 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 01:05:28,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:05:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:05:28,744 INFO L93 Difference]: Finished difference Result 155 states and 282 transitions. [2024-10-13 01:05:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:05:28,872 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 174 [2024-10-13 01:05:28,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:05:28,879 INFO L225 Difference]: With dead ends: 155 [2024-10-13 01:05:28,879 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 01:05:28,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 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-13 01:05:28,885 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-13 01:05:28,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-13 01:05:28,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 01:05:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-13 01:05:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 01:05:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 122 transitions. [2024-10-13 01:05:28,934 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 122 transitions. Word has length 174 [2024-10-13 01:05:28,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:05:28,935 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 122 transitions. [2024-10-13 01:05:28,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 01:05:28,940 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 122 transitions. [2024-10-13 01:05:28,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-13 01:05:28,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:05:28,945 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:05:28,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 01:05:29,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:05:29,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:05:29,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:05:29,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1654095375, now seen corresponding path program 1 times [2024-10-13 01:05:29,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:05:29,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93650393] [2024-10-13 01:05:29,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:05:29,147 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-13 01:05:29,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:05:29,150 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:05:29,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 01:05:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:05:30,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 01:05:30,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:05:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 01:05:35,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:05:35,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:05:35,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93650393] [2024-10-13 01:05:35,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93650393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:05:35,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:05:35,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:05:35,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381295900] [2024-10-13 01:05:35,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:05:35,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:05:35,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:05:35,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:05:35,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:05:35,264 INFO L87 Difference]: Start difference. First operand 77 states and 122 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 01:05:39,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:05:43,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:05:48,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:05:52,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:05:56,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:06:00,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:06:04,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:06:09,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:06:13,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:06:17,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:06:21,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:06:25,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []