./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-66.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 8867ed3eb9bb6f50b3cec69ccd976a6d4dcee2295e8a0520ceede677a47386da --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:46:11,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:46:11,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:46:11,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:46:11,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:46:11,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:46:11,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:46:11,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:46:11,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:46:11,242 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:46:11,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:46:11,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:46:11,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:46:11,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:46:11,244 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:46:11,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:46:11,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:46:11,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:46:11,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:46:11,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:46:11,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:46:11,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:46:11,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:46:11,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:46:11,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:46:11,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:46:11,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:46:11,248 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:46:11,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:46:11,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:46:11,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:46:11,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:46:11,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:46:11,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:46:11,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:46:11,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:46:11,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:46:11,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:46:11,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:46:11,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:46:11,251 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:46:11,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:46:11,252 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 -> 8867ed3eb9bb6f50b3cec69ccd976a6d4dcee2295e8a0520ceede677a47386da [2024-11-10 03:46:11,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:46:11,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:46:11,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:46:11,483 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:46:11,484 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:46:11,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-66.i [2024-11-10 03:46:12,719 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:46:12,881 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:46:12,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-66.i [2024-11-10 03:46:12,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8769664d7/adeb24d00e78490d947ea71e28ae6b58/FLAG1da15be16 [2024-11-10 03:46:12,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8769664d7/adeb24d00e78490d947ea71e28ae6b58 [2024-11-10 03:46:12,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:46:12,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:46:12,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:46:12,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:46:12,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:46:12,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:46:12" (1/1) ... [2024-11-10 03:46:12,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69bab8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:12, skipping insertion in model container [2024-11-10 03:46:12,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:46:12" (1/1) ... [2024-11-10 03:46:12,937 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:46:13,082 WARN L250 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_normal_file-66.i[913,926] [2024-11-10 03:46:13,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:46:13,134 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:46:13,142 WARN L250 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_normal_file-66.i[913,926] [2024-11-10 03:46:13,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:46:13,176 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:46:13,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:13 WrapperNode [2024-11-10 03:46:13,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:46:13,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:46:13,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:46:13,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:46:13,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:13" (1/1) ... [2024-11-10 03:46:13,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:13" (1/1) ... [2024-11-10 03:46:13,216 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-11-10 03:46:13,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:46:13,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:46:13,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:46:13,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:46:13,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:13" (1/1) ... [2024-11-10 03:46:13,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:13" (1/1) ... [2024-11-10 03:46:13,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:13" (1/1) ... [2024-11-10 03:46:13,250 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-11-10 03:46:13,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:13" (1/1) ... [2024-11-10 03:46:13,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:13" (1/1) ... [2024-11-10 03:46:13,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:13" (1/1) ... [2024-11-10 03:46:13,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:13" (1/1) ... [2024-11-10 03:46:13,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:13" (1/1) ... [2024-11-10 03:46:13,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:13" (1/1) ... [2024-11-10 03:46:13,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:46:13,275 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:46:13,275 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:46:13,275 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:46:13,275 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:13" (1/1) ... [2024-11-10 03:46:13,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:46:13,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:46:13,313 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-11-10 03:46:13,322 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-11-10 03:46:13,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:46:13,356 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:46:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:46:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:46:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:46:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:46:13,423 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:46:13,425 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:46:13,709 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 03:46:13,710 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:46:13,721 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:46:13,722 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:46:13,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:46:13 BoogieIcfgContainer [2024-11-10 03:46:13,722 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:46:13,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:46:13,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:46:13,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:46:13,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:46:12" (1/3) ... [2024-11-10 03:46:13,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5b9f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:46:13, skipping insertion in model container [2024-11-10 03:46:13,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:13" (2/3) ... [2024-11-10 03:46:13,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5b9f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:46:13, skipping insertion in model container [2024-11-10 03:46:13,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:46:13" (3/3) ... [2024-11-10 03:46:13,731 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-66.i [2024-11-10 03:46:13,744 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:46:13,744 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:46:13,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:46:13,795 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;@56c99a5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:46:13,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:46:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 03:46:13,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 03:46:13,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:13,813 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:46:13,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:13,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:13,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1142491791, now seen corresponding path program 1 times [2024-11-10 03:46:13,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:13,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713091307] [2024-11-10 03:46:13,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:13,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:46:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:46:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:46:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:46:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:46:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:46:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:46:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:46:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:46:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:46:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:46:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:46:17,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:17,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713091307] [2024-11-10 03:46:17,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713091307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:17,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 03:46:17,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462013696] [2024-11-10 03:46:17,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:17,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 03:46:17,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:17,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 03:46:17,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-10 03:46:17,539 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:46:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:18,309 INFO L93 Difference]: Finished difference Result 254 states and 410 transitions. [2024-11-10 03:46:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 03:46:18,311 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-10 03:46:18,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:18,322 INFO L225 Difference]: With dead ends: 254 [2024-11-10 03:46:18,322 INFO L226 Difference]: Without dead ends: 193 [2024-11-10 03:46:18,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-10 03:46:18,330 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 197 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:18,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 553 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 03:46:18,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-10 03:46:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 105. [2024-11-10 03:46:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 03:46:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2024-11-10 03:46:18,394 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 121 [2024-11-10 03:46:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:18,395 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2024-11-10 03:46:18,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:46:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2024-11-10 03:46:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 03:46:18,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:18,401 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:46:18,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:46:18,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:18,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:18,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1171120942, now seen corresponding path program 1 times [2024-11-10 03:46:18,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:18,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166876025] [2024-11-10 03:46:18,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:18,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:46:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:46:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:46:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:46:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:46:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:46:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:46:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:46:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:46:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:46:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:46:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:46:21,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:21,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166876025] [2024-11-10 03:46:21,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166876025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:21,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:21,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 03:46:21,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902635530] [2024-11-10 03:46:21,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:21,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 03:46:21,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:21,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 03:46:21,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-10 03:46:21,859 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:46:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:23,446 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2024-11-10 03:46:23,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 03:46:23,447 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-10 03:46:23,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:23,449 INFO L225 Difference]: With dead ends: 193 [2024-11-10 03:46:23,449 INFO L226 Difference]: Without dead ends: 190 [2024-11-10 03:46:23,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-10 03:46:23,450 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 203 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:23,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 573 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 03:46:23,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-10 03:46:23,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 105. [2024-11-10 03:46:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 03:46:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2024-11-10 03:46:23,461 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 121 [2024-11-10 03:46:23,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:23,462 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2024-11-10 03:46:23,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:46:23,462 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2024-11-10 03:46:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 03:46:23,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:23,464 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:46:23,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:46:23,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:23,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:23,464 INFO L85 PathProgramCache]: Analyzing trace with hash 945978286, now seen corresponding path program 1 times [2024-11-10 03:46:23,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:23,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223083612] [2024-11-10 03:46:23,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:23,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:46:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:46:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:46:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:46:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:46:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:46:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:46:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:46:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:46:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:46:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:46:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:46:26,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:26,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223083612] [2024-11-10 03:46:26,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223083612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:26,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:26,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 03:46:26,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437222419] [2024-11-10 03:46:26,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:26,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 03:46:26,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:26,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 03:46:26,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-10 03:46:26,399 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:46:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:27,106 INFO L93 Difference]: Finished difference Result 201 states and 266 transitions. [2024-11-10 03:46:27,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 03:46:27,109 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-10 03:46:27,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:27,111 INFO L225 Difference]: With dead ends: 201 [2024-11-10 03:46:27,111 INFO L226 Difference]: Without dead ends: 198 [2024-11-10 03:46:27,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-10 03:46:27,112 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 210 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:27,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 542 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 03:46:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-10 03:46:27,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 109. [2024-11-10 03:46:27,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 85 states have internal predecessors, (117), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 03:46:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2024-11-10 03:46:27,131 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 121 [2024-11-10 03:46:27,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:27,132 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2024-11-10 03:46:27,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:46:27,134 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2024-11-10 03:46:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 03:46:27,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:27,137 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:46:27,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:46:27,137 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:27,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:27,138 INFO L85 PathProgramCache]: Analyzing trace with hash 974607437, now seen corresponding path program 1 times [2024-11-10 03:46:27,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:27,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661843552] [2024-11-10 03:46:27,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:27,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:46:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:46:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:46:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:46:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:46:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:46:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:46:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:46:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:46:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:46:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:46:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:46:31,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:31,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661843552] [2024-11-10 03:46:31,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661843552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:31,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:31,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 03:46:31,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358034875] [2024-11-10 03:46:31,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:31,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 03:46:31,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:31,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 03:46:31,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-10 03:46:31,043 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:46:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:32,285 INFO L93 Difference]: Finished difference Result 198 states and 263 transitions. [2024-11-10 03:46:32,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 03:46:32,285 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-10 03:46:32,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:32,287 INFO L225 Difference]: With dead ends: 198 [2024-11-10 03:46:32,287 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 03:46:32,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-10 03:46:32,288 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 208 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:32,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 616 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 03:46:32,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 03:46:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 105. [2024-11-10 03:46:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 03:46:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2024-11-10 03:46:32,302 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 121 [2024-11-10 03:46:32,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:32,303 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2024-11-10 03:46:32,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:46:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2024-11-10 03:46:32,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 03:46:32,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:32,306 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:46:32,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:46:32,306 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:32,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:32,307 INFO L85 PathProgramCache]: Analyzing trace with hash 849088784, now seen corresponding path program 1 times [2024-11-10 03:46:32,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:32,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991333918] [2024-11-10 03:46:32,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:32,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:46:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:46:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:46:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:46:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:46:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:46:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:46:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:46:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:46:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:46:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:46:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:46:32,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:32,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991333918] [2024-11-10 03:46:32,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991333918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:32,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:32,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:46:32,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549780486] [2024-11-10 03:46:32,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:32,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:46:32,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:32,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:46:32,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:46:32,375 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:46:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:32,414 INFO L93 Difference]: Finished difference Result 290 states and 431 transitions. [2024-11-10 03:46:32,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:46:32,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-10 03:46:32,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:32,417 INFO L225 Difference]: With dead ends: 290 [2024-11-10 03:46:32,418 INFO L226 Difference]: Without dead ends: 188 [2024-11-10 03:46:32,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-11-10 03:46:32,423 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 75 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:32,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 227 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:46:32,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-10 03:46:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2024-11-10 03:46:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 138 states have internal predecessors, (179), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 03:46:32,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 267 transitions. [2024-11-10 03:46:32,444 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 267 transitions. Word has length 121 [2024-11-10 03:46:32,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:32,444 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 267 transitions. [2024-11-10 03:46:32,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:46:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 267 transitions. [2024-11-10 03:46:32,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 03:46:32,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:32,446 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:46:32,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 03:46:32,446 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:32,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:32,446 INFO L85 PathProgramCache]: Analyzing trace with hash -958365679, now seen corresponding path program 1 times [2024-11-10 03:46:32,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:32,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690846515] [2024-11-10 03:46:32,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:32,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:46:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:46:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:46:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:46:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:46:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:46:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:46:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:46:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:46:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:46:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:46:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:46:32,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:32,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690846515] [2024-11-10 03:46:32,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690846515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:32,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:32,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:46:32,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253017382] [2024-11-10 03:46:32,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:32,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:46:32,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:32,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:46:32,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:46:32,558 INFO L87 Difference]: Start difference. First operand 185 states and 267 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:46:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:32,712 INFO L93 Difference]: Finished difference Result 547 states and 778 transitions. [2024-11-10 03:46:32,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:46:32,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-10 03:46:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:32,715 INFO L225 Difference]: With dead ends: 547 [2024-11-10 03:46:32,715 INFO L226 Difference]: Without dead ends: 365 [2024-11-10 03:46:32,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:46:32,717 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 74 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:32,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 274 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:46:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-10 03:46:32,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 316. [2024-11-10 03:46:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 226 states have internal predecessors, (287), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 03:46:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 455 transitions. [2024-11-10 03:46:32,744 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 455 transitions. Word has length 121 [2024-11-10 03:46:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:32,745 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 455 transitions. [2024-11-10 03:46:32,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:46:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 455 transitions. [2024-11-10 03:46:32,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 03:46:32,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:32,746 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:46:32,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 03:46:32,746 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:32,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:32,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1154879184, now seen corresponding path program 1 times [2024-11-10 03:46:32,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:32,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366924139] [2024-11-10 03:46:32,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:32,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:46:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:46:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:46:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:46:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:46:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:46:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:46:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:46:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:46:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:46:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:46:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:46:34,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:34,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366924139] [2024-11-10 03:46:34,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366924139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:34,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:34,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 03:46:34,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307985971] [2024-11-10 03:46:34,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:34,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 03:46:34,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:34,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 03:46:34,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:46:34,163 INFO L87 Difference]: Start difference. First operand 316 states and 455 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:46:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:34,817 INFO L93 Difference]: Finished difference Result 475 states and 635 transitions. [2024-11-10 03:46:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 03:46:34,818 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-10 03:46:34,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:34,820 INFO L225 Difference]: With dead ends: 475 [2024-11-10 03:46:34,820 INFO L226 Difference]: Without dead ends: 472 [2024-11-10 03:46:34,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-10 03:46:34,821 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 273 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:34,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 505 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:46:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-10 03:46:34,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 374. [2024-11-10 03:46:34,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 270 states have (on average 1.2666666666666666) internal successors, (342), 275 states have internal predecessors, (342), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-10 03:46:34,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 526 transitions. [2024-11-10 03:46:34,859 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 526 transitions. Word has length 121 [2024-11-10 03:46:34,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:34,860 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 526 transitions. [2024-11-10 03:46:34,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:46:34,860 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 526 transitions. [2024-11-10 03:46:34,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 03:46:34,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:34,861 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:46:34,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 03:46:34,861 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:34,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:34,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1126250033, now seen corresponding path program 1 times [2024-11-10 03:46:34,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:34,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493616169] [2024-11-10 03:46:34,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:34,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:46:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:46:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:46:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:46:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:46:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:46:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:46:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:46:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:46:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:46:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:46:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:46:37,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:37,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493616169] [2024-11-10 03:46:37,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493616169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:37,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:37,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 03:46:37,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494161339] [2024-11-10 03:46:37,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:37,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 03:46:37,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:37,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 03:46:37,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-10 03:46:37,145 INFO L87 Difference]: Start difference. First operand 374 states and 526 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:46:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:38,740 INFO L93 Difference]: Finished difference Result 472 states and 632 transitions. [2024-11-10 03:46:38,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 03:46:38,741 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-10 03:46:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:38,743 INFO L225 Difference]: With dead ends: 472 [2024-11-10 03:46:38,743 INFO L226 Difference]: Without dead ends: 469 [2024-11-10 03:46:38,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-10 03:46:38,744 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 226 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:38,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 690 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 03:46:38,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-10 03:46:38,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 374. [2024-11-10 03:46:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 270 states have (on average 1.2666666666666666) internal successors, (342), 275 states have internal predecessors, (342), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-10 03:46:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 526 transitions. [2024-11-10 03:46:38,779 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 526 transitions. Word has length 121 [2024-11-10 03:46:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:38,780 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 526 transitions. [2024-11-10 03:46:38,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:46:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 526 transitions. [2024-11-10 03:46:38,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 03:46:38,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:38,781 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:46:38,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 03:46:38,781 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:38,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:38,782 INFO L85 PathProgramCache]: Analyzing trace with hash 636933166, now seen corresponding path program 1 times [2024-11-10 03:46:38,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:38,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143149773] [2024-11-10 03:46:38,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:38,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:46:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:46:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:46:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:46:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:46:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:46:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:46:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:46:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:46:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:46:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:46:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:38,996 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:46:38,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:38,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143149773] [2024-11-10 03:46:38,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143149773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:38,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:38,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:46:38,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658182110] [2024-11-10 03:46:38,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:38,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:46:38,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:38,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:46:38,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:46:38,999 INFO L87 Difference]: Start difference. First operand 374 states and 526 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 03:46:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:39,172 INFO L93 Difference]: Finished difference Result 709 states and 985 transitions. [2024-11-10 03:46:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:46:39,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2024-11-10 03:46:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:39,175 INFO L225 Difference]: With dead ends: 709 [2024-11-10 03:46:39,175 INFO L226 Difference]: Without dead ends: 382 [2024-11-10 03:46:39,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:46:39,177 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 130 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:39,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 174 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:46:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-10 03:46:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 372. [2024-11-10 03:46:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 262 states have (on average 1.2251908396946565) internal successors, (321), 267 states have internal predecessors, (321), 96 states have call successors, (96), 13 states have call predecessors, (96), 13 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-10 03:46:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 513 transitions. [2024-11-10 03:46:39,211 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 513 transitions. Word has length 121 [2024-11-10 03:46:39,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:39,212 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 513 transitions. [2024-11-10 03:46:39,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 03:46:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 513 transitions. [2024-11-10 03:46:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 03:46:39,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:39,213 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:46:39,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 03:46:39,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:39,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:39,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1213374564, now seen corresponding path program 1 times [2024-11-10 03:46:39,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:39,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151669876] [2024-11-10 03:46:39,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:39,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:46:39,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [408636652] [2024-11-10 03:46:39,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:39,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:46:39,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:46:39,250 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-11-10 03:46:39,251 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-11-10 03:46:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:39,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 03:46:39,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:46:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 415 proven. 105 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-10 03:46:41,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:46:52,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:52,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151669876] [2024-11-10 03:46:52,997 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 03:46:52,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408636652] [2024-11-10 03:46:52,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408636652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:46:52,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 03:46:52,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2024-11-10 03:46:52,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814844568] [2024-11-10 03:46:52,999 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 03:46:52,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 03:46:52,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:53,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 03:46:53,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=580, Unknown=2, NotChecked=0, Total=756 [2024-11-10 03:46:53,000 INFO L87 Difference]: Start difference. First operand 372 states and 513 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 7 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2024-11-10 03:46:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:56,357 INFO L93 Difference]: Finished difference Result 900 states and 1141 transitions. [2024-11-10 03:46:56,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-10 03:46:56,358 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 7 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) Word has length 122 [2024-11-10 03:46:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:56,362 INFO L225 Difference]: With dead ends: 900 [2024-11-10 03:46:56,362 INFO L226 Difference]: Without dead ends: 715 [2024-11-10 03:46:56,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=597, Invalid=2053, Unknown=2, NotChecked=0, Total=2652 [2024-11-10 03:46:56,363 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 222 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 61 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:56,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 352 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 559 Invalid, 2 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 03:46:56,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-10 03:46:56,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 461. [2024-11-10 03:46:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 332 states have (on average 1.1897590361445782) internal successors, (395), 337 states have internal predecessors, (395), 94 states have call successors, (94), 34 states have call predecessors, (94), 34 states have return successors, (94), 89 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-10 03:46:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 583 transitions. [2024-11-10 03:46:56,413 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 583 transitions. Word has length 122 [2024-11-10 03:46:56,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:56,413 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 583 transitions. [2024-11-10 03:46:56,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 7 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2024-11-10 03:46:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 583 transitions. [2024-11-10 03:46:56,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 03:46:56,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:56,415 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:46:56,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 03:46:56,615 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,SelfDestructingSolverStorable9 [2024-11-10 03:46:56,616 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:56,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:56,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1184745413, now seen corresponding path program 1 times [2024-11-10 03:46:56,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:56,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545109191] [2024-11-10 03:46:56,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:56,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:46:56,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1703036495] [2024-11-10 03:46:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:56,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:46:56,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:46:56,664 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-11-10 03:46:56,666 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-11-10 03:46:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:46:56,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:46:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:46:56,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:46:56,823 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:46:56,824 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:46:56,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 03:46:57,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 03:46:57,030 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:46:57,102 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:46:57,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:46:57 BoogieIcfgContainer [2024-11-10 03:46:57,104 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:46:57,105 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:46:57,105 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:46:57,105 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:46:57,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:46:13" (3/4) ... [2024-11-10 03:46:57,107 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:46:57,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:46:57,109 INFO L158 Benchmark]: Toolchain (without parser) took 44202.95ms. Allocated memory was 178.3MB in the beginning and 465.6MB in the end (delta: 287.3MB). Free memory was 111.2MB in the beginning and 284.3MB in the end (delta: -173.2MB). Peak memory consumption was 117.3MB. Max. memory is 16.1GB. [2024-11-10 03:46:57,109 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory was 66.8MB in the beginning and 66.7MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:46:57,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.61ms. Allocated memory is still 178.3MB. Free memory was 110.9MB in the beginning and 95.8MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 03:46:57,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.20ms. Allocated memory is still 178.3MB. Free memory was 95.8MB in the beginning and 92.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 03:46:57,109 INFO L158 Benchmark]: Boogie Preprocessor took 56.99ms. Allocated memory is still 178.3MB. Free memory was 92.7MB in the beginning and 88.2MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:46:57,110 INFO L158 Benchmark]: IcfgBuilder took 447.84ms. Allocated memory is still 178.3MB. Free memory was 88.2MB in the beginning and 135.9MB in the end (delta: -47.8MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-10 03:46:57,110 INFO L158 Benchmark]: TraceAbstraction took 43380.08ms. Allocated memory was 178.3MB in the beginning and 465.6MB in the end (delta: 287.3MB). Free memory was 135.2MB in the beginning and 284.3MB in the end (delta: -149.2MB). Peak memory consumption was 139.9MB. Max. memory is 16.1GB. [2024-11-10 03:46:57,110 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 465.6MB. Free memory is still 284.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:46:57,111 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory was 66.8MB in the beginning and 66.7MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.61ms. Allocated memory is still 178.3MB. Free memory was 110.9MB in the beginning and 95.8MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.20ms. Allocated memory is still 178.3MB. Free memory was 95.8MB in the beginning and 92.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.99ms. Allocated memory is still 178.3MB. Free memory was 92.7MB in the beginning and 88.2MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 447.84ms. Allocated memory is still 178.3MB. Free memory was 88.2MB in the beginning and 135.9MB in the end (delta: -47.8MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 43380.08ms. Allocated memory was 178.3MB in the beginning and 465.6MB in the end (delta: 287.3MB). Free memory was 135.2MB in the beginning and 284.3MB in the end (delta: -149.2MB). Peak memory consumption was 139.9MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 465.6MB. Free memory is still 284.3MB. 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 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L89] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L90] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L90] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L91] var_1_4 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L92] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L93] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L93] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L94] var_1_6 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L95] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L96] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L96] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L97] var_1_7 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L98] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L99] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L99] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L100] var_1_10 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L101] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L102] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L102] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L103] var_1_11 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L104] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L105] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L105] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L106] var_1_14 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L107] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L108] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L108] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L109] var_1_20 = __VERIFIER_nondet_short() [L110] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L110] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L111] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L111] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L112] var_1_21 = __VERIFIER_nondet_short() [L113] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L113] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L114] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L114] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L128] RET updateVariables() [L129] CALL step() [L43] signed char stepLocal_1 = var_1_6; [L44] unsigned char stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_1=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L45] COND FALSE !(-25 == stepLocal_1) [L50] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=65534] [L52] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_2=2, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=65534] [L53] COND TRUE var_1_8 >= stepLocal_2 [L54] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=65534] [L56] COND TRUE \read(var_1_12) [L57] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=65534] [L59] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=65534] [L60] COND TRUE \read(var_1_12) [L61] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=65534] [L64] signed char stepLocal_4 = var_1_6; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_4=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=65534] [L65] COND TRUE var_1_1 < stepLocal_4 [L66] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-1, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=65534] [L70] COND TRUE \read(var_1_12) [L71] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-1, var_1_19=-16380, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=65534] [L73] COND TRUE -64 > (var_1_6 + var_1_19) [L74] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=65532, var_1_16=-16, var_1_18=-1, var_1_19=-16380, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=65534] [L82] signed long int stepLocal_3 = ((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10); VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_3=65534, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=65532, var_1_16=-16, var_1_18=-1, var_1_19=-16380, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=65534] [L83] COND FALSE !(var_1_19 > stepLocal_3) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=65532, var_1_16=-16, var_1_18=-1, var_1_19=-16380, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=65534] [L129] RET step() [L130] CALL, EXPR property() [L120-L121] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=65532, var_1_16=-16, var_1_18=-1, var_1_19=-16380, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=65534] [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=65532, var_1_16=-16, var_1_18=-1, var_1_19=-16380, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=65534] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=65534, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=65532, var_1_16=-16, var_1_18=-1, var_1_19=-16380, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=1, var_1_4=-1, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=65534] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.3s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1830 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1818 mSDsluCounter, 4506 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3528 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3699 IncrementalHoareTripleChecker+Invalid, 3850 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 978 mSDtfsCounter, 3699 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 648 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 18.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=10, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 861 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 31.0s InterpolantComputationTime, 1577 NumberOfCodeBlocks, 1577 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1201 ConstructedInterpolants, 1 QuantifiedInterpolants, 12760 SizeOfPredicates, 11 NumberOfNonLiveVariables, 291 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 6015/6120 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-11-10 03:46:57,321 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-10 03:46:57,375 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 137 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-66.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 8867ed3eb9bb6f50b3cec69ccd976a6d4dcee2295e8a0520ceede677a47386da --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:46:58,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:46:59,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:46:59,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:46:59,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:46:59,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:46:59,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:46:59,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:46:59,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:46:59,080 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:46:59,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:46:59,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:46:59,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:46:59,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:46:59,083 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:46:59,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:46:59,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:46:59,083 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:46:59,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:46:59,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:46:59,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:46:59,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:46:59,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:46:59,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:46:59,088 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:46:59,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:46:59,089 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:46:59,089 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:46:59,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:46:59,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:46:59,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:46:59,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:46:59,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:46:59,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:46:59,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:46:59,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:46:59,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:46:59,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:46:59,090 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:46:59,091 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:46:59,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:46:59,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:46:59,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:46:59,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:46:59,093 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 -> 8867ed3eb9bb6f50b3cec69ccd976a6d4dcee2295e8a0520ceede677a47386da [2024-11-10 03:46:59,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:46:59,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:46:59,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:46:59,375 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:46:59,375 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:46:59,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-66.i [2024-11-10 03:47:00,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:47:00,928 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:47:00,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-66.i [2024-11-10 03:47:00,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528d484bf/f49899db7b894e69adc4a383bbe2385b/FLAG28ce12f3c [2024-11-10 03:47:00,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528d484bf/f49899db7b894e69adc4a383bbe2385b [2024-11-10 03:47:00,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:47:00,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:47:00,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:47:00,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:47:00,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:47:00,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:47:00" (1/1) ... [2024-11-10 03:47:00,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29aad0ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:00, skipping insertion in model container [2024-11-10 03:47:00,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:47:00" (1/1) ... [2024-11-10 03:47:00,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:47:01,146 WARN L250 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_normal_file-66.i[913,926] [2024-11-10 03:47:01,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:47:01,221 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:47:01,233 WARN L250 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_normal_file-66.i[913,926] [2024-11-10 03:47:01,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:47:01,287 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:47:01,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:01 WrapperNode [2024-11-10 03:47:01,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:47:01,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:47:01,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:47:01,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:47:01,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:01" (1/1) ... [2024-11-10 03:47:01,311 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:01" (1/1) ... [2024-11-10 03:47:01,336 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-10 03:47:01,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:47:01,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:47:01,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:47:01,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:47:01,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:01" (1/1) ... [2024-11-10 03:47:01,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:01" (1/1) ... [2024-11-10 03:47:01,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:01" (1/1) ... [2024-11-10 03:47:01,367 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-11-10 03:47:01,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:01" (1/1) ... [2024-11-10 03:47:01,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:01" (1/1) ... [2024-11-10 03:47:01,382 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:01" (1/1) ... [2024-11-10 03:47:01,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:01" (1/1) ... [2024-11-10 03:47:01,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:01" (1/1) ... [2024-11-10 03:47:01,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:01" (1/1) ... [2024-11-10 03:47:01,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:47:01,397 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:47:01,397 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:47:01,397 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:47:01,402 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:01" (1/1) ... [2024-11-10 03:47:01,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:47:01,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:47:01,439 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-11-10 03:47:01,445 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-11-10 03:47:01,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:47:01,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:47:01,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:47:01,487 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:47:01,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:47:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:47:01,561 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:47:01,563 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:47:01,904 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 03:47:01,905 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:47:01,920 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:47:01,921 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:47:01,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:47:01 BoogieIcfgContainer [2024-11-10 03:47:01,921 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:47:01,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:47:01,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:47:01,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:47:01,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:47:00" (1/3) ... [2024-11-10 03:47:01,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226617ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:47:01, skipping insertion in model container [2024-11-10 03:47:01,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:01" (2/3) ... [2024-11-10 03:47:01,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226617ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:47:01, skipping insertion in model container [2024-11-10 03:47:01,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:47:01" (3/3) ... [2024-11-10 03:47:01,931 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-66.i [2024-11-10 03:47:01,946 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:47:01,946 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:47:02,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:47:02,015 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;@25baaa68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:47:02,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:47:02,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 03:47:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 03:47:02,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:47:02,034 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:47:02,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:47:02,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:47:02,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1142491791, now seen corresponding path program 1 times [2024-11-10 03:47:02,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:47:02,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134975517] [2024-11-10 03:47:02,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:47:02,055 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-11-10 03:47:02,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:47:02,058 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-11-10 03:47:02,061 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-11-10 03:47:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:47:02,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 03:47:02,256 INFO L278 TraceCheckSpWp]: Computing forward predicates...