./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-10_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.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 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:04:31,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:04:31,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:04:31,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:04:31,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:04:31,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:04:31,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:04:31,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:04:31,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:04:31,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:04:31,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:04:31,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:04:31,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:04:31,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:04:31,374 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:04:31,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:04:31,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:04:31,374 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:04:31,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:04:31,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:04:31,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:04:31,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:04:31,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:04:31,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:04:31,378 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:04:31,378 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:04:31,378 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:04:31,379 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:04:31,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:04:31,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:04:31,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:04:31,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:04:31,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:04:31,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:04:31,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:04:31,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:04:31,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:04:31,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:04:31,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:04:31,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:04:31,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:04:31,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:04:31,382 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 -> 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 [2024-10-24 06:04:31,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:04:31,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:04:31,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:04:31,655 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:04:31,655 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:04:31,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-10-24 06:04:33,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:04:33,186 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:04:33,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-10-24 06:04:33,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf993167/bafdd32237994febb3b8ae9c7963cb91/FLAG15cd58628 [2024-10-24 06:04:33,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf993167/bafdd32237994febb3b8ae9c7963cb91 [2024-10-24 06:04:33,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:04:33,212 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:04:33,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:04:33,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:04:33,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:04:33,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:04:33" (1/1) ... [2024-10-24 06:04:33,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7168bec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:04:33, skipping insertion in model container [2024-10-24 06:04:33,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:04:33" (1/1) ... [2024-10-24 06:04:33,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:04:33,395 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-10_file-4.i[914,927] [2024-10-24 06:04:33,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:04:33,456 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:04:33,466 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-10_file-4.i[914,927] [2024-10-24 06:04:33,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:04:33,510 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:04:33,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:04:33 WrapperNode [2024-10-24 06:04:33,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:04:33,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:04:33,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:04:33,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:04:33,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:04:33" (1/1) ... [2024-10-24 06:04:33,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:04:33" (1/1) ... [2024-10-24 06:04:33,552 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2024-10-24 06:04:33,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:04:33,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:04:33,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:04:33,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:04:33,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:04:33" (1/1) ... [2024-10-24 06:04:33,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:04:33" (1/1) ... [2024-10-24 06:04:33,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:04:33" (1/1) ... [2024-10-24 06:04:33,578 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:04:33,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:04:33" (1/1) ... [2024-10-24 06:04:33,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:04:33" (1/1) ... [2024-10-24 06:04:33,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:04:33" (1/1) ... [2024-10-24 06:04:33,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:04:33" (1/1) ... [2024-10-24 06:04:33,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:04:33" (1/1) ... [2024-10-24 06:04:33,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:04:33" (1/1) ... [2024-10-24 06:04:33,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:04:33,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:04:33,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:04:33,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:04:33,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:04:33" (1/1) ... [2024-10-24 06:04:33,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:04:33,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:04:33,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:04:33,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:04:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:04:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:04:33,691 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:04:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:04:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:04:33,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:04:33,764 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:04:33,766 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:04:34,139 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 06:04:34,140 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:04:34,176 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:04:34,176 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:04:34,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:04:34 BoogieIcfgContainer [2024-10-24 06:04:34,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:04:34,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:04:34,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:04:34,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:04:34,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:04:33" (1/3) ... [2024-10-24 06:04:34,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2e9741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:04:34, skipping insertion in model container [2024-10-24 06:04:34,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:04:33" (2/3) ... [2024-10-24 06:04:34,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2e9741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:04:34, skipping insertion in model container [2024-10-24 06:04:34,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:04:34" (3/3) ... [2024-10-24 06:04:34,186 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-10-24 06:04:34,200 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:04:34,201 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:04:34,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:04:34,260 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;@72701165, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:04:34,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:04:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 06:04:34,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-24 06:04:34,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:04:34,281 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:04:34,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:04:34,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:04:34,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1856197234, now seen corresponding path program 1 times [2024-10-24 06:04:34,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:04:34,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661167256] [2024-10-24 06:04:34,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:04:34,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:04:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:04:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:04:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:04:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:04:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:04:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:04:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:04:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:04:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:04:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:04:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:04:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:04:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:04:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:04:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:04:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:04:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:04:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:04:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:04:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:04:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:04:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:04:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:04:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:04:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:04:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:04:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:04:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:04:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:04:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:04:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 06:04:34,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:04:34,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661167256] [2024-10-24 06:04:34,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661167256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:04:34,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:04:34,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:04:34,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780410333] [2024-10-24 06:04:34,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:04:34,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:04:34,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:04:34,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:04:34,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:04:34,832 INFO L87 Difference]: Start difference. First operand has 75 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 06:04:34,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:04:34,883 INFO L93 Difference]: Finished difference Result 147 states and 266 transitions. [2024-10-24 06:04:34,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:04:34,887 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 182 [2024-10-24 06:04:34,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:04:34,896 INFO L225 Difference]: With dead ends: 147 [2024-10-24 06:04:34,896 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 06:04:34,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:04:34,907 INFO L432 NwaCegarLoop]: 110 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, 110 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:04:34,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:04:34,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 06:04:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 06:04:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 06:04:34,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 113 transitions. [2024-10-24 06:04:34,956 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 113 transitions. Word has length 182 [2024-10-24 06:04:34,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:04:34,956 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 113 transitions. [2024-10-24 06:04:34,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 06:04:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 113 transitions. [2024-10-24 06:04:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-24 06:04:34,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:04:34,966 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:04:34,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:04:34,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:04:34,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:04:34,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1529732019, now seen corresponding path program 1 times [2024-10-24 06:04:34,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:04:34,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917020247] [2024-10-24 06:04:34,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:04:34,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:04:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:04:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:04:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:04:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:04:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:04:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:04:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:04:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:04:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:04:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:04:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:04:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:04:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:04:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:04:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:04:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:04:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:04:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:04:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:04:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:04:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:04:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:04:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:04:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:04:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:04:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:04:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:04:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:04:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:04:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:04:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 06:04:35,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:04:35,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917020247] [2024-10-24 06:04:35,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917020247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:04:35,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:04:35,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:04:35,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303871792] [2024-10-24 06:04:35,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:04:35,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:04:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:04:35,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:04:35,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:04:35,974 INFO L87 Difference]: Start difference. First operand 73 states and 113 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:04:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:04:36,345 INFO L93 Difference]: Finished difference Result 240 states and 366 transitions. [2024-10-24 06:04:36,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 06:04:36,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 183 [2024-10-24 06:04:36,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:04:36,351 INFO L225 Difference]: With dead ends: 240 [2024-10-24 06:04:36,351 INFO L226 Difference]: Without dead ends: 168 [2024-10-24 06:04:36,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 06:04:36,354 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 136 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:04:36,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 555 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:04:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-24 06:04:36,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 147. [2024-10-24 06:04:36,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 84 states have internal predecessors, (108), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 06:04:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 228 transitions. [2024-10-24 06:04:36,380 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 228 transitions. Word has length 183 [2024-10-24 06:04:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:04:36,381 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 228 transitions. [2024-10-24 06:04:36,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:04:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 228 transitions. [2024-10-24 06:04:36,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-24 06:04:36,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:04:36,383 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:04:36,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:04:36,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:04:36,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:04:36,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1529791601, now seen corresponding path program 1 times [2024-10-24 06:04:36,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:04:36,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698592091] [2024-10-24 06:04:36,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:04:36,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:04:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:04:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:04:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:04:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:04:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:04:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:04:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:04:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:04:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:04:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:04:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:04:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:04:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:04:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:04:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:04:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:04:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:04:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:04:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:04:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:04:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:04:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:04:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:04:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:04:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:04:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:04:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:04:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:04:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:04:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:04:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 06:04:40,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:04:40,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698592091] [2024-10-24 06:04:40,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698592091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:04:40,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:04:40,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 06:04:40,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949588275] [2024-10-24 06:04:40,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:04:40,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 06:04:40,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:04:40,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 06:04:40,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 06:04:40,159 INFO L87 Difference]: Start difference. First operand 147 states and 228 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:04:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:04:40,593 INFO L93 Difference]: Finished difference Result 395 states and 591 transitions. [2024-10-24 06:04:40,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 06:04:40,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 183 [2024-10-24 06:04:40,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:04:40,598 INFO L225 Difference]: With dead ends: 395 [2024-10-24 06:04:40,601 INFO L226 Difference]: Without dead ends: 249 [2024-10-24 06:04:40,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-24 06:04:40,603 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 86 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:04:40,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 396 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:04:40,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-24 06:04:40,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 200. [2024-10-24 06:04:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 131 states have (on average 1.297709923664122) internal successors, (170), 133 states have internal predecessors, (170), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 06:04:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 298 transitions. [2024-10-24 06:04:40,628 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 298 transitions. Word has length 183 [2024-10-24 06:04:40,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:04:40,629 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 298 transitions. [2024-10-24 06:04:40,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:04:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 298 transitions. [2024-10-24 06:04:40,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-24 06:04:40,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:04:40,631 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:04:40,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:04:40,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:04:40,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:04:40,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2064111117, now seen corresponding path program 1 times [2024-10-24 06:04:40,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:04:40,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594498256] [2024-10-24 06:04:40,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:04:40,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:04:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:04:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:04:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:04:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:04:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:04:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:04:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:04:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:04:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:04:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:04:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:04:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:04:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:04:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:04:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:04:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:04:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:04:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:04:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:04:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:04:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:04:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:04:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:04:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:04:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:04:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:04:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:04:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:04:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:04:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:04:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 06:04:40,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:04:40,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594498256] [2024-10-24 06:04:40,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594498256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:04:40,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:04:40,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:04:40,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819232765] [2024-10-24 06:04:40,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:04:40,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:04:40,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:04:40,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:04:40,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:04:40,994 INFO L87 Difference]: Start difference. First operand 200 states and 298 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:04:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:04:41,081 INFO L93 Difference]: Finished difference Result 581 states and 868 transitions. [2024-10-24 06:04:41,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:04:41,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 183 [2024-10-24 06:04:41,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:04:41,087 INFO L225 Difference]: With dead ends: 581 [2024-10-24 06:04:41,087 INFO L226 Difference]: Without dead ends: 382 [2024-10-24 06:04:41,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-24 06:04:41,089 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 57 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:04:41,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 221 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:04:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-10-24 06:04:41,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2024-10-24 06:04:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 243 states have (on average 1.2757201646090535) internal successors, (310), 247 states have internal predecessors, (310), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 124 states have call predecessors, (128), 128 states have call successors, (128) [2024-10-24 06:04:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 566 transitions. [2024-10-24 06:04:41,158 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 566 transitions. Word has length 183 [2024-10-24 06:04:41,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:04:41,162 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 566 transitions. [2024-10-24 06:04:41,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:04:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 566 transitions. [2024-10-24 06:04:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 06:04:41,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:04:41,165 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:04:41,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:04:41,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:04:41,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:04:41,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1182987610, now seen corresponding path program 1 times [2024-10-24 06:04:41,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:04:41,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407209730] [2024-10-24 06:04:41,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:04:41,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:04:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:04:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:04:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:04:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:04:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:04:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:04:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:04:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:04:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:04:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:04:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:04:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:04:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:04:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:04:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:04:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:04:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:04:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:04:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:04:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:04:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:04:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:04:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:04:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:04:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:04:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:04:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:04:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:04:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:04:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:04:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 06:04:41,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:04:41,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407209730] [2024-10-24 06:04:41,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407209730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:04:41,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:04:41,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:04:41,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128034235] [2024-10-24 06:04:41,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:04:41,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:04:41,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:04:41,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:04:41,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:04:41,391 INFO L87 Difference]: Start difference. First operand 380 states and 566 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:04:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:04:41,590 INFO L93 Difference]: Finished difference Result 750 states and 1117 transitions. [2024-10-24 06:04:41,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:04:41,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 184 [2024-10-24 06:04:41,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:04:41,594 INFO L225 Difference]: With dead ends: 750 [2024-10-24 06:04:41,594 INFO L226 Difference]: Without dead ends: 551 [2024-10-24 06:04:41,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:04:41,596 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 121 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:04:41,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 418 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:04:41,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-10-24 06:04:41,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 542. [2024-10-24 06:04:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 337 states have (on average 1.2492581602373887) internal successors, (421), 343 states have internal predecessors, (421), 192 states have call successors, (192), 12 states have call predecessors, (192), 12 states have return successors, (192), 186 states have call predecessors, (192), 192 states have call successors, (192) [2024-10-24 06:04:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 805 transitions. [2024-10-24 06:04:41,666 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 805 transitions. Word has length 184 [2024-10-24 06:04:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:04:41,667 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 805 transitions. [2024-10-24 06:04:41,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:04:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 805 transitions. [2024-10-24 06:04:41,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 06:04:41,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:04:41,669 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:04:41,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 06:04:41,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:04:41,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:04:41,670 INFO L85 PathProgramCache]: Analyzing trace with hash 373640984, now seen corresponding path program 1 times [2024-10-24 06:04:41,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:04:41,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426905440] [2024-10-24 06:04:41,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:04:41,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:04:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:04:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:04:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:04:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:04:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:04:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:04:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:04:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:04:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:04:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:04:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:04:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:04:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:04:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:04:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:04:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:04:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:04:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:04:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:04:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:04:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:04:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:04:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:04:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:04:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:04:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:04:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:04:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:04:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:04:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:04:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 24 proven. 63 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 06:04:42,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:04:42,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426905440] [2024-10-24 06:04:42,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426905440] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:04:42,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513960254] [2024-10-24 06:04:42,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:04:42,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:04:42,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:04:42,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:04:42,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 06:04:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:04:42,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-24 06:04:42,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:04:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 843 proven. 225 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-10-24 06:04:45,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:05:16,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513960254] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:05:16,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:05:16,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16] total 23 [2024-10-24 06:05:16,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585935492] [2024-10-24 06:05:16,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:05:16,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 06:05:16,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:05:16,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 06:05:16,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=967, Unknown=3, NotChecked=0, Total=1260 [2024-10-24 06:05:16,818 INFO L87 Difference]: Start difference. First operand 542 states and 805 transitions. Second operand has 23 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 22 states have internal predecessors, (85), 7 states have call successors, (60), 6 states have call predecessors, (60), 9 states have return successors, (60), 7 states have call predecessors, (60), 7 states have call successors, (60) [2024-10-24 06:05:21,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:05:21,584 INFO L93 Difference]: Finished difference Result 1845 states and 2613 transitions. [2024-10-24 06:05:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-10-24 06:05:21,585 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 22 states have internal predecessors, (85), 7 states have call successors, (60), 6 states have call predecessors, (60), 9 states have return successors, (60), 7 states have call predecessors, (60), 7 states have call successors, (60) Word has length 184 [2024-10-24 06:05:21,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:05:21,592 INFO L225 Difference]: With dead ends: 1845 [2024-10-24 06:05:21,593 INFO L226 Difference]: Without dead ends: 1484 [2024-10-24 06:05:21,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4471 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=2936, Invalid=11103, Unknown=3, NotChecked=0, Total=14042 [2024-10-24 06:05:21,598 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 895 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 2378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 1820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 06:05:21,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 947 Invalid, 2378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 1820 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 06:05:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2024-10-24 06:05:21,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1318. [2024-10-24 06:05:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 814 states have (on average 1.203931203931204) internal successors, (980), 833 states have internal predecessors, (980), 442 states have call successors, (442), 61 states have call predecessors, (442), 61 states have return successors, (442), 423 states have call predecessors, (442), 442 states have call successors, (442) [2024-10-24 06:05:21,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1864 transitions. [2024-10-24 06:05:21,719 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1864 transitions. Word has length 184 [2024-10-24 06:05:21,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:05:21,720 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1864 transitions. [2024-10-24 06:05:21,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 22 states have internal predecessors, (85), 7 states have call successors, (60), 6 states have call predecessors, (60), 9 states have return successors, (60), 7 states have call predecessors, (60), 7 states have call successors, (60) [2024-10-24 06:05:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1864 transitions. [2024-10-24 06:05:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 06:05:21,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:05:21,722 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:05:21,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 06:05:21,923 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-24 06:05:21,924 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:05:21,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:05:21,924 INFO L85 PathProgramCache]: Analyzing trace with hash 77544473, now seen corresponding path program 1 times [2024-10-24 06:05:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:05:21,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707203204] [2024-10-24 06:05:21,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:05:21,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:05:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:05:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:05:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:05:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:05:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:05:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:05:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:05:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:05:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:05:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:05:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:05:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:05:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:05:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:05:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:05:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:05:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:05:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:05:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:05:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:05:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:05:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:05:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:05:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:05:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:05:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:05:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:05:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:05:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:05:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:05:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 3 proven. 84 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 06:05:22,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:05:22,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707203204] [2024-10-24 06:05:22,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707203204] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:05:22,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971364465] [2024-10-24 06:05:22,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:05:22,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:05:22,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:05:22,375 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:05:22,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 06:05:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:22,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 06:05:22,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:05:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 143 proven. 84 refuted. 0 times theorem prover too weak. 1513 trivial. 0 not checked. [2024-10-24 06:05:22,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:05:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 3 proven. 84 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 06:05:23,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971364465] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:05:23,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:05:23,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-10-24 06:05:23,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516339261] [2024-10-24 06:05:23,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:05:23,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 06:05:23,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:05:23,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 06:05:23,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 06:05:23,092 INFO L87 Difference]: Start difference. First operand 1318 states and 1864 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2024-10-24 06:05:23,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:05:23,867 INFO L93 Difference]: Finished difference Result 2812 states and 3890 transitions. [2024-10-24 06:05:23,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 06:05:23,868 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 184 [2024-10-24 06:05:23,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:05:23,876 INFO L225 Difference]: With dead ends: 2812 [2024-10-24 06:05:23,877 INFO L226 Difference]: Without dead ends: 1569 [2024-10-24 06:05:23,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 422 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-10-24 06:05:23,881 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 85 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 06:05:23,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 559 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 06:05:23,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2024-10-24 06:05:24,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1168. [2024-10-24 06:05:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 727 states have (on average 1.2063273727647867) internal successors, (877), 731 states have internal predecessors, (877), 384 states have call successors, (384), 56 states have call predecessors, (384), 56 states have return successors, (384), 380 states have call predecessors, (384), 384 states have call successors, (384) [2024-10-24 06:05:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1645 transitions. [2024-10-24 06:05:24,026 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1645 transitions. Word has length 184 [2024-10-24 06:05:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:05:24,027 INFO L471 AbstractCegarLoop]: Abstraction has 1168 states and 1645 transitions. [2024-10-24 06:05:24,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2024-10-24 06:05:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1645 transitions. [2024-10-24 06:05:24,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 06:05:24,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:05:24,028 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:05:24,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 06:05:24,232 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,SelfDestructingSolverStorable6 [2024-10-24 06:05:24,233 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:05:24,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:05:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash 77604055, now seen corresponding path program 1 times [2024-10-24 06:05:24,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:05:24,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556869888] [2024-10-24 06:05:24,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:05:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:05:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:05:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:05:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:05:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:05:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:05:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:05:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:05:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:05:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:05:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:05:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:05:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:05:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:05:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:05:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:05:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:05:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:05:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:05:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:05:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:05:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:05:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:05:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:05:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:05:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:05:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:05:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:05:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:05:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:05:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:05:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 06:05:24,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:05:24,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556869888] [2024-10-24 06:05:24,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556869888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:05:24,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:05:24,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:05:24,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145752876] [2024-10-24 06:05:24,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:05:24,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:05:24,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:05:24,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:05:24,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:05:24,496 INFO L87 Difference]: Start difference. First operand 1168 states and 1645 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:05:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:05:24,619 INFO L93 Difference]: Finished difference Result 2063 states and 2928 transitions. [2024-10-24 06:05:24,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:05:24,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 184 [2024-10-24 06:05:24,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:05:24,626 INFO L225 Difference]: With dead ends: 2063 [2024-10-24 06:05:24,627 INFO L226 Difference]: Without dead ends: 854 [2024-10-24 06:05:24,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-24 06:05:24,631 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 104 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:05:24,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 216 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:05:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-10-24 06:05:24,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 852. [2024-10-24 06:05:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 535 states have (on average 1.2112149532710281) internal successors, (648), 537 states have internal predecessors, (648), 282 states have call successors, (282), 34 states have call predecessors, (282), 34 states have return successors, (282), 280 states have call predecessors, (282), 282 states have call successors, (282) [2024-10-24 06:05:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1212 transitions. [2024-10-24 06:05:24,720 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1212 transitions. Word has length 184 [2024-10-24 06:05:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:05:24,721 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1212 transitions. [2024-10-24 06:05:24,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:05:24,721 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1212 transitions. [2024-10-24 06:05:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 06:05:24,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:05:24,723 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:05:24,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 06:05:24,723 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:05:24,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:05:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1592082608, now seen corresponding path program 1 times [2024-10-24 06:05:24,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:05:24,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661851874] [2024-10-24 06:05:24,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:05:24,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:05:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:05:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:05:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:05:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:05:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:05:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:05:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:05:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:05:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:05:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:05:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:05:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:05:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:05:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:05:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:05:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:05:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:24,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:05:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:25,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:05:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:25,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:05:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:25,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:05:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:25,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:05:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:25,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:05:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:25,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:05:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:25,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:05:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:25,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:05:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:25,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:05:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:25,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:05:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:25,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:05:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:25,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:05:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:25,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:05:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 9 proven. 78 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 06:05:25,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:05:25,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661851874] [2024-10-24 06:05:25,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661851874] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:05:25,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835368167] [2024-10-24 06:05:25,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:05:25,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:05:25,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:05:25,037 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:05:25,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 06:05:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:25,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 06:05:25,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:05:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 347 proven. 78 refuted. 0 times theorem prover too weak. 1315 trivial. 0 not checked. [2024-10-24 06:05:25,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:05:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 9 proven. 78 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 06:05:25,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835368167] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:05:25,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:05:25,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 06:05:25,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599129140] [2024-10-24 06:05:25,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:05:25,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 06:05:25,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:05:25,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 06:05:25,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:05:25,642 INFO L87 Difference]: Start difference. First operand 852 states and 1212 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2024-10-24 06:05:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:05:25,859 INFO L93 Difference]: Finished difference Result 1109 states and 1529 transitions. [2024-10-24 06:05:25,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 06:05:25,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) Word has length 184 [2024-10-24 06:05:25,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:05:25,864 INFO L225 Difference]: With dead ends: 1109 [2024-10-24 06:05:25,864 INFO L226 Difference]: Without dead ends: 258 [2024-10-24 06:05:25,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 424 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 06:05:25,867 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 27 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:05:25,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 140 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:05:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-24 06:05:25,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 236. [2024-10-24 06:05:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 147 states have (on average 1.0748299319727892) internal successors, (158), 148 states have internal predecessors, (158), 68 states have call successors, (68), 20 states have call predecessors, (68), 20 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-24 06:05:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 294 transitions. [2024-10-24 06:05:25,922 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 294 transitions. Word has length 184 [2024-10-24 06:05:25,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:05:25,923 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 294 transitions. [2024-10-24 06:05:25,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2024-10-24 06:05:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 294 transitions. [2024-10-24 06:05:25,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-24 06:05:25,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:05:25,924 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:05:25,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 06:05:26,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:05:26,126 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:05:26,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:05:26,126 INFO L85 PathProgramCache]: Analyzing trace with hash -885153356, now seen corresponding path program 1 times [2024-10-24 06:05:26,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:05:26,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489294607] [2024-10-24 06:05:26,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:05:26,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:05:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:05:26,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [692184218] [2024-10-24 06:05:26,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:05:26,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:05:26,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:05:26,210 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:05:26,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 06:05:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:05:26,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:05:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:05:26,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:05:26,439 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:05:26,440 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:05:26,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 06:05:26,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:05:26,645 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:05:26,758 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:05:26,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:05:26 BoogieIcfgContainer [2024-10-24 06:05:26,761 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:05:26,762 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:05:26,762 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:05:26,762 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:05:26,763 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:04:34" (3/4) ... [2024-10-24 06:05:26,764 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:05:26,765 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:05:26,765 INFO L158 Benchmark]: Toolchain (without parser) took 53553.62ms. Allocated memory was 125.8MB in the beginning and 346.0MB in the end (delta: 220.2MB). Free memory was 87.4MB in the beginning and 206.9MB in the end (delta: -119.4MB). Peak memory consumption was 101.2MB. Max. memory is 16.1GB. [2024-10-24 06:05:26,766 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:05:26,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.05ms. Allocated memory is still 125.8MB. Free memory was 87.4MB in the beginning and 71.1MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 06:05:26,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.76ms. Allocated memory is still 125.8MB. Free memory was 71.1MB in the beginning and 67.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:05:26,766 INFO L158 Benchmark]: Boogie Preprocessor took 42.72ms. Allocated memory is still 125.8MB. Free memory was 67.7MB in the beginning and 63.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:05:26,766 INFO L158 Benchmark]: RCFGBuilder took 581.05ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 63.5MB in the beginning and 130.6MB in the end (delta: -67.2MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2024-10-24 06:05:26,766 INFO L158 Benchmark]: TraceAbstraction took 52582.31ms. Allocated memory was 165.7MB in the beginning and 346.0MB in the end (delta: 180.4MB). Free memory was 129.5MB in the beginning and 207.9MB in the end (delta: -78.4MB). Peak memory consumption was 101.9MB. Max. memory is 16.1GB. [2024-10-24 06:05:26,766 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 346.0MB. Free memory is still 206.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:05:26,767 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.15ms. Allocated memory is still 125.8MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.05ms. Allocated memory is still 125.8MB. Free memory was 87.4MB in the beginning and 71.1MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.76ms. Allocated memory is still 125.8MB. Free memory was 71.1MB in the beginning and 67.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.72ms. Allocated memory is still 125.8MB. Free memory was 67.7MB in the beginning and 63.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 581.05ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 63.5MB in the beginning and 130.6MB in the end (delta: -67.2MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * TraceAbstraction took 52582.31ms. Allocated memory was 165.7MB in the beginning and 346.0MB in the end (delta: 180.4MB). Free memory was 129.5MB in the beginning and 207.9MB in the end (delta: -78.4MB). Peak memory consumption was 101.9MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 346.0MB. Free memory is still 206.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryArithmeticDOUBLEoperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] signed char var_1_23 = 1; [L40] signed char var_1_24 = 2; [L41] signed short int var_1_25 = -500; [L42] signed char var_1_26 = -2; [L43] unsigned short int var_1_27 = 256; [L44] unsigned char var_1_28 = 0; [L45] unsigned short int var_1_29 = 39250; [L46] unsigned short int var_1_30 = 256; [L47] unsigned short int var_1_31 = 25; [L48] unsigned short int var_1_32 = 4; [L49] signed char var_1_33 = -8; [L50] signed char var_1_34 = -2; [L51] unsigned short int last_1_var_1_6 = 4; [L52] unsigned short int last_1_var_1_9 = 4; [L53] unsigned long int last_1_var_1_14 = 500; [L54] signed short int last_1_var_1_17 = 16; [L171] isInitial = 1 [L172] FCALL initially() [L173] COND TRUE 1 [L174] CALL updateLastVariables() [L161] last_1_var_1_6 = var_1_6 [L162] last_1_var_1_9 = var_1_9 [L163] last_1_var_1_14 = var_1_14 [L164] last_1_var_1_17 = var_1_17 [L174] RET updateLastVariables() [L175] CALL updateVariables() [L113] var_1_4 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_5=0, var_1_6=4, var_1_9=4] [L114] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_5=0, var_1_6=4, var_1_9=4] [L115] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L115] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] var_1_5 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_6=4, var_1_9=4] [L117] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_6=4, var_1_9=4] [L118] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L118] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] var_1_10 = __VERIFIER_nondet_ushort() [L120] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L120] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] var_1_12 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L123] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L124] var_1_13 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L125] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L126] var_1_15 = __VERIFIER_nondet_ulong() [L127] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L127] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L128] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L129] var_1_16 = __VERIFIER_nondet_ulong() [L130] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L130] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L131] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L132] var_1_19 = __VERIFIER_nondet_short() [L133] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L133] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L135] var_1_20 = __VERIFIER_nondet_short() [L136] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L136] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L137] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L137] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L138] var_1_21 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L139] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L140] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L141] var_1_22 = __VERIFIER_nondet_short() [L142] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L142] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L143] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L143] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L144] var_1_24 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_24 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L145] RET assume_abort_if_not(var_1_24 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] var_1_28 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L148] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] var_1_29 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L151] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] var_1_30 = __VERIFIER_nondet_ushort() [L154] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L154] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] var_1_31 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] CALL assume_abort_if_not(var_1_31 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] RET assume_abort_if_not(var_1_31 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L175] RET updateVariables() [L176] CALL step() [L58] var_1_23 = var_1_24 [L59] var_1_25 = var_1_23 [L60] var_1_26 = var_1_24 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L61] COND TRUE \read(var_1_28) [L62] var_1_27 = (((((var_1_29 - var_1_30)) < (var_1_31)) ? ((var_1_29 - var_1_30)) : (var_1_31))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L64] var_1_32 = var_1_30 [L65] var_1_33 = var_1_24 [L66] var_1_34 = var_1_24 [L67] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L68] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L73] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L74] COND TRUE last_1_var_1_14 >= stepLocal_3 [L75] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=65534, var_1_11=78/5, var_1_14=3221159921, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L77] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=65534, var_1_11=78/5, var_1_14=3221159921, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L78] COND TRUE (- var_1_14) > var_1_6 [L79] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=65534, var_1_11=78/5, var_1_14=3221159921, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L84] unsigned char stepLocal_2 = var_1_4; [L85] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221159921, stepLocal_2=0, var_1_10=65534, var_1_11=78/5, var_1_14=3221159921, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L86] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221159921, var_1_10=65534, var_1_11=78/5, var_1_14=3221159921, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L89] COND TRUE stepLocal_1 >= var_1_6 [L90] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=65534, var_1_11=78/5, var_1_14=3221159921, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=65534] [L95] unsigned char stepLocal_5 = var_1_1; [L96] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=65534, var_1_11=78/5, var_1_14=3221159921, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=65534] [L97] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=65534, var_1_11=78/5, var_1_14=3221159921, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=65534] [L104] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=65534, var_1_11=78/5, var_1_14=3221159921, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=65534] [L105] COND TRUE ! var_1_1 [L106] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=65534, var_1_14=3221159921, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=65534] [L176] RET step() [L177] CALL, EXPR property() [L167-L168] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; [L177] RET, EXPR property() [L177] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_14=3221159921, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=65534] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=65534, var_1_14=3221159921, var_1_15=2147483647, var_1_16=3221225471, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=65534] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.4s, OverallIterations: 10, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1545 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1511 mSDsluCounter, 3562 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2404 mSDsCounter, 644 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3097 IncrementalHoareTripleChecker+Invalid, 3741 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 644 mSolverCounterUnsat, 1158 mSDtfsCounter, 3097 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1809 GetRequests, 1642 SyntacticMatches, 4 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4543 ImplicationChecksByTransitivity, 21.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1318occurred in iteration=6, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 672 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 42.1s InterpolantComputationTime, 2573 NumberOfCodeBlocks, 2573 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2557 ConstructedInterpolants, 0 QuantifiedInterpolants, 12104 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1314 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 23586/24360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 06:05:26,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.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 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:05:28,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:05:28,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:05:28,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:05:28,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:05:28,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:05:28,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:05:28,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:05:28,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:05:28,875 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:05:28,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:05:28,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:05:28,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:05:28,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:05:28,877 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:05:28,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:05:28,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:05:28,878 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:05:28,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:05:28,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:05:28,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:05:28,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:05:28,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:05:28,880 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:05:28,880 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:05:28,880 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:05:28,881 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:05:28,881 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:05:28,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:05:28,881 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:05:28,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:05:28,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:05:28,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:05:28,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:05:28,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:05:28,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:05:28,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:05:28,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:05:28,883 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:05:28,884 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:05:28,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:05:28,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:05:28,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:05:28,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:05:28,889 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:05:28,889 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 -> 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 [2024-10-24 06:05:29,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:05:29,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:05:29,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:05:29,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:05:29,214 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:05:29,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-10-24 06:05:30,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:05:30,865 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:05:30,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-10-24 06:05:30,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b95561b/5722c5c250ec49a18c7d7de8e1e06b7e/FLAG3ef09dc31 [2024-10-24 06:05:31,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b95561b/5722c5c250ec49a18c7d7de8e1e06b7e [2024-10-24 06:05:31,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:05:31,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:05:31,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:05:31,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:05:31,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:05:31,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:05:31" (1/1) ... [2024-10-24 06:05:31,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@792ba481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:05:31, skipping insertion in model container [2024-10-24 06:05:31,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:05:31" (1/1) ... [2024-10-24 06:05:31,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:05:31,464 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-10_file-4.i[914,927] [2024-10-24 06:05:31,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:05:31,561 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:05:31,572 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-10_file-4.i[914,927] [2024-10-24 06:05:31,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:05:31,634 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:05:31,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:05:31 WrapperNode [2024-10-24 06:05:31,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:05:31,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:05:31,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:05:31,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:05:31,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:05:31" (1/1) ... [2024-10-24 06:05:31,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:05:31" (1/1) ... [2024-10-24 06:05:31,690 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-10-24 06:05:31,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:05:31,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:05:31,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:05:31,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:05:31,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:05:31" (1/1) ... [2024-10-24 06:05:31,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:05:31" (1/1) ... [2024-10-24 06:05:31,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:05:31" (1/1) ... [2024-10-24 06:05:31,734 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:05:31,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:05:31" (1/1) ... [2024-10-24 06:05:31,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:05:31" (1/1) ... [2024-10-24 06:05:31,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:05:31" (1/1) ... [2024-10-24 06:05:31,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:05:31" (1/1) ... [2024-10-24 06:05:31,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:05:31" (1/1) ... [2024-10-24 06:05:31,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:05:31" (1/1) ... [2024-10-24 06:05:31,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:05:31,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:05:31,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:05:31,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:05:31,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:05:31" (1/1) ... [2024-10-24 06:05:31,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:05:31,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:05:31,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:05:31,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:05:31,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:05:31,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:05:31,853 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:05:31,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:05:31,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:05:31,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:05:31,953 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:05:31,955 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:05:32,497 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 06:05:32,497 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:05:32,569 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:05:32,569 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:05:32,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:05:32 BoogieIcfgContainer [2024-10-24 06:05:32,570 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:05:32,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:05:32,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:05:32,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:05:32,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:05:31" (1/3) ... [2024-10-24 06:05:32,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5198036b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:05:32, skipping insertion in model container [2024-10-24 06:05:32,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:05:31" (2/3) ... [2024-10-24 06:05:32,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5198036b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:05:32, skipping insertion in model container [2024-10-24 06:05:32,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:05:32" (3/3) ... [2024-10-24 06:05:32,579 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-10-24 06:05:32,592 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:05:32,592 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:05:32,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:05:32,660 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;@f87f17f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:05:32,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:05:32,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 06:05:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-24 06:05:32,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:05:32,683 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:05:32,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:05:32,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:05:32,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1856197234, now seen corresponding path program 1 times [2024-10-24 06:05:32,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:05:32,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624068702] [2024-10-24 06:05:32,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:05:32,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:05:32,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:05:32,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:05:32,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 06:05:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:33,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:05:33,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:05:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2024-10-24 06:05:33,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:05:33,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:05:33,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624068702] [2024-10-24 06:05:33,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624068702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:05:33,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:05:33,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:05:33,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237317851] [2024-10-24 06:05:33,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:05:33,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:05:33,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:05:33,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:05:33,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:05:33,162 INFO L87 Difference]: Start difference. First operand has 75 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 06:05:33,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:05:33,497 INFO L93 Difference]: Finished difference Result 147 states and 266 transitions. [2024-10-24 06:05:33,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:05:33,517 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 182 [2024-10-24 06:05:33,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:05:33,523 INFO L225 Difference]: With dead ends: 147 [2024-10-24 06:05:33,523 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 06:05:33,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:05:33,532 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 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.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:05:33,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:05:33,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 06:05:33,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 06:05:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 06:05:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 113 transitions. [2024-10-24 06:05:33,581 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 113 transitions. Word has length 182 [2024-10-24 06:05:33,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:05:33,584 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 113 transitions. [2024-10-24 06:05:33,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 06:05:33,584 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 113 transitions. [2024-10-24 06:05:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-24 06:05:33,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:05:33,589 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:05:33,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 06:05:33,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:05:33,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:05:33,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:05:33,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1529732019, now seen corresponding path program 1 times [2024-10-24 06:05:33,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:05:33,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251902823] [2024-10-24 06:05:33,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:05:33,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:05:33,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:05:33,801 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:05:33,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 06:05:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:34,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 06:05:34,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:05:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 279 proven. 159 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2024-10-24 06:05:35,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:05:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 9 proven. 162 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2024-10-24 06:05:35,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:05:35,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251902823] [2024-10-24 06:05:35,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251902823] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:05:35,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:05:35,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-10-24 06:05:35,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334729553] [2024-10-24 06:05:35,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:05:35,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 06:05:35,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:05:35,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 06:05:35,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-24 06:05:35,739 INFO L87 Difference]: Start difference. First operand 73 states and 113 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 3 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2024-10-24 06:05:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:05:37,066 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2024-10-24 06:05:37,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 06:05:37,067 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 3 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 183 [2024-10-24 06:05:37,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:05:37,071 INFO L225 Difference]: With dead ends: 169 [2024-10-24 06:05:37,071 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 06:05:37,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 351 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-10-24 06:05:37,073 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 48 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:05:37,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 268 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 06:05:37,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 06:05:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2024-10-24 06:05:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 06:05:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 119 transitions. [2024-10-24 06:05:37,091 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 119 transitions. Word has length 183 [2024-10-24 06:05:37,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:05:37,092 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 119 transitions. [2024-10-24 06:05:37,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 3 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2024-10-24 06:05:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 119 transitions. [2024-10-24 06:05:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 06:05:37,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:05:37,094 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:05:37,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 06:05:37,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:05:37,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:05:37,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:05:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1182987610, now seen corresponding path program 1 times [2024-10-24 06:05:37,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:05:37,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049618138] [2024-10-24 06:05:37,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:05:37,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:05:37,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:05:37,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:05:37,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 06:05:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:37,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 06:05:37,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:05:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 06:05:37,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:05:37,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:05:37,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049618138] [2024-10-24 06:05:37,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049618138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:05:37,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:05:37,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:05:37,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362160948] [2024-10-24 06:05:37,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:05:37,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:05:37,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:05:37,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:05:37,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:05:37,782 INFO L87 Difference]: Start difference. First operand 85 states and 119 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:05:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:05:38,668 INFO L93 Difference]: Finished difference Result 246 states and 345 transitions. [2024-10-24 06:05:38,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:05:38,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 184 [2024-10-24 06:05:38,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:05:38,675 INFO L225 Difference]: With dead ends: 246 [2024-10-24 06:05:38,675 INFO L226 Difference]: Without dead ends: 162 [2024-10-24 06:05:38,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 06:05:38,678 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 118 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 06:05:38,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 277 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 06:05:38,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-24 06:05:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2024-10-24 06:05:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 93 states have (on average 1.118279569892473) internal successors, (104), 93 states have internal predecessors, (104), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 06:05:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 224 transitions. [2024-10-24 06:05:38,710 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 224 transitions. Word has length 184 [2024-10-24 06:05:38,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:05:38,711 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 224 transitions. [2024-10-24 06:05:38,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:05:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 224 transitions. [2024-10-24 06:05:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 06:05:38,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:05:38,719 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:05:38,730 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 (4)] Ended with exit code 0 [2024-10-24 06:05:38,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:05:38,920 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:05:38,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:05:38,921 INFO L85 PathProgramCache]: Analyzing trace with hash 373640984, now seen corresponding path program 1 times [2024-10-24 06:05:38,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:05:38,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694358260] [2024-10-24 06:05:38,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:05:38,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:05:38,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:05:38,925 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:05:38,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 06:05:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:39,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 06:05:39,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:05:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 717 proven. 63 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2024-10-24 06:05:40,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:05:40,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:05:40,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694358260] [2024-10-24 06:05:40,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694358260] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:05:40,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1838315123] [2024-10-24 06:05:40,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:05:40,582 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 06:05:40,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 06:05:40,587 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 06:05:40,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-24 06:05:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:41,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 06:05:41,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:05:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 818 proven. 117 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-24 06:05:42,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:05:42,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1838315123] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:05:42,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:05:42,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-10-24 06:05:42,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670604868] [2024-10-24 06:05:42,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:05:42,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 06:05:42,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:05:42,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 06:05:42,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-10-24 06:05:42,678 INFO L87 Difference]: Start difference. First operand 160 states and 224 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 16 states have internal predecessors, (82), 5 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) [2024-10-24 06:05:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:05:46,358 INFO L93 Difference]: Finished difference Result 439 states and 593 transitions. [2024-10-24 06:05:46,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 06:05:46,360 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 16 states have internal predecessors, (82), 5 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) Word has length 184 [2024-10-24 06:05:46,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:05:46,363 INFO L225 Difference]: With dead ends: 439 [2024-10-24 06:05:46,364 INFO L226 Difference]: Without dead ends: 280 [2024-10-24 06:05:46,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2024-10-24 06:05:46,365 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 206 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-24 06:05:46,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 556 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-24 06:05:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-24 06:05:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 260. [2024-10-24 06:05:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 154 states have (on average 1.0974025974025974) internal successors, (169), 154 states have internal predecessors, (169), 90 states have call successors, (90), 15 states have call predecessors, (90), 15 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-24 06:05:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 349 transitions. [2024-10-24 06:05:46,438 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 349 transitions. Word has length 184 [2024-10-24 06:05:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:05:46,438 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 349 transitions. [2024-10-24 06:05:46,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 16 states have internal predecessors, (82), 5 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) [2024-10-24 06:05:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 349 transitions. [2024-10-24 06:05:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 06:05:46,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:05:46,441 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:05:46,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 06:05:46,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-10-24 06:05:46,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 06:05:46,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:05:46,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:05:46,842 INFO L85 PathProgramCache]: Analyzing trace with hash 631806422, now seen corresponding path program 1 times [2024-10-24 06:05:46,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:05:46,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165475604] [2024-10-24 06:05:46,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:05:46,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:05:46,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:05:46,844 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:05:46,846 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 (7)] Waiting until timeout for monitored process [2024-10-24 06:05:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:47,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 06:05:47,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:05:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 06:05:47,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:05:47,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:05:47,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165475604] [2024-10-24 06:05:47,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165475604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:05:47,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:05:47,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:05:47,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53416503] [2024-10-24 06:05:47,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:05:47,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:05:47,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:05:47,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:05:47,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:05:47,624 INFO L87 Difference]: Start difference. First operand 260 states and 349 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:05:48,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:05:48,353 INFO L93 Difference]: Finished difference Result 433 states and 578 transitions. [2024-10-24 06:05:48,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:05:48,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 184 [2024-10-24 06:05:48,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:05:48,370 INFO L225 Difference]: With dead ends: 433 [2024-10-24 06:05:48,370 INFO L226 Difference]: Without dead ends: 174 [2024-10-24 06:05:48,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:05:48,372 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 43 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 06:05:48,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 321 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 06:05:48,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-24 06:05:48,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 159. [2024-10-24 06:05:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 88 states have (on average 1.0568181818181819) internal successors, (93), 88 states have internal predecessors, (93), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 06:05:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 213 transitions. [2024-10-24 06:05:48,397 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 213 transitions. Word has length 184 [2024-10-24 06:05:48,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:05:48,398 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 213 transitions. [2024-10-24 06:05:48,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:05:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 213 transitions. [2024-10-24 06:05:48,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-24 06:05:48,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:05:48,400 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:05:48,411 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 (7)] Ended with exit code 0 [2024-10-24 06:05:48,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:05:48,601 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:05:48,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:05:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash -885153356, now seen corresponding path program 1 times [2024-10-24 06:05:48,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:05:48,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822582209] [2024-10-24 06:05:48,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:05:48,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:05:48,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:05:48,605 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:05:48,606 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 (8)] Waiting until timeout for monitored process [2024-10-24 06:05:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:05:48,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 06:05:48,828 INFO L278 TraceCheckSpWp]: Computing forward predicates...