./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 8be7027f 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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:39:42,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:39:43,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:39:43,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:39:43,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:39:43,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:39:43,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:39:43,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:39:43,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:39:43,037 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:39:43,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:39:43,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:39:43,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:39:43,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:39:43,039 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:39:43,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:39:43,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:39:43,040 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:39:43,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:39:43,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:39:43,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:39:43,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:39:43,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:39:43,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:39:43,046 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:39:43,046 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:39:43,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:39:43,046 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:39:43,047 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:39:43,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:39:43,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:39:43,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:39:43,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:39:43,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:39:43,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:39:43,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:39:43,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:39:43,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:39:43,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:39:43,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:39:43,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:39:43,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:39:43,055 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-12 01:39:43,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:39:43,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:39:43,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:39:43,350 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:39:43,350 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:39:43,351 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-12 01:39:44,833 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:39:45,028 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:39:45,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-66.i [2024-11-12 01:39:45,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15044780c/d90343a3b70d404b84539935c17d5318/FLAG7b0dcf71f [2024-11-12 01:39:45,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15044780c/d90343a3b70d404b84539935c17d5318 [2024-11-12 01:39:45,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:39:45,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:39:45,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:39:45,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:39:45,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:39:45,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:39:45" (1/1) ... [2024-11-12 01:39:45,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d816daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:39:45, skipping insertion in model container [2024-11-12 01:39:45,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:39:45" (1/1) ... [2024-11-12 01:39:45,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:39:45,261 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-12 01:39:45,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:39:45,326 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:39:45,335 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-12 01:39:45,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:39:45,384 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:39:45,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:39:45 WrapperNode [2024-11-12 01:39:45,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:39:45,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:39:45,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:39:45,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:39:45,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:39:45" (1/1) ... [2024-11-12 01:39:45,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:39:45" (1/1) ... [2024-11-12 01:39:45,448 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-12 01:39:45,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:39:45,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:39:45,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:39:45,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:39:45,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:39:45" (1/1) ... [2024-11-12 01:39:45,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:39:45" (1/1) ... [2024-11-12 01:39:45,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:39:45" (1/1) ... [2024-11-12 01:39:45,491 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-12 01:39:45,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:39:45" (1/1) ... [2024-11-12 01:39:45,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:39:45" (1/1) ... [2024-11-12 01:39:45,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:39:45" (1/1) ... [2024-11-12 01:39:45,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:39:45" (1/1) ... [2024-11-12 01:39:45,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:39:45" (1/1) ... [2024-11-12 01:39:45,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:39:45" (1/1) ... [2024-11-12 01:39:45,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:39:45,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:39:45,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:39:45,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:39:45,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:39:45" (1/1) ... [2024-11-12 01:39:45,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:39:45,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:39:45,564 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-12 01:39:45,567 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-12 01:39:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:39:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:39:45,619 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:39:45,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:39:45,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:39:45,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:39:45,703 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:39:45,705 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:39:46,022 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-12 01:39:46,023 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:39:46,036 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:39:46,037 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:39:46,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:39:46 BoogieIcfgContainer [2024-11-12 01:39:46,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:39:46,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:39:46,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:39:46,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:39:46,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:39:45" (1/3) ... [2024-11-12 01:39:46,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd4067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:39:46, skipping insertion in model container [2024-11-12 01:39:46,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:39:45" (2/3) ... [2024-11-12 01:39:46,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd4067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:39:46, skipping insertion in model container [2024-11-12 01:39:46,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:39:46" (3/3) ... [2024-11-12 01:39:46,045 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-66.i [2024-11-12 01:39:46,063 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:39:46,064 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:39:46,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:39:46,134 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;@1462de2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:39:46,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:39:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 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-12 01:39:46,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 01:39:46,154 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:39:46,155 INFO L218 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] [2024-11-12 01:39:46,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:39:46,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:39:46,164 INFO L85 PathProgramCache]: Analyzing trace with hash 38250463, now seen corresponding path program 1 times [2024-11-12 01:39:46,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:39:46,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497795734] [2024-11-12 01:39:46,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:39:46,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:39:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:39:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:39:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:39:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:39:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:39:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:39:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:39:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:39:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:39:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:39:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:39:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:39:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:39:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:39:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:39:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:39:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:39:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:39:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:51,250 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-12 01:39:51,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:39:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497795734] [2024-11-12 01:39:51,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497795734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:39:51,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:39:51,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 01:39:51,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688286648] [2024-11-12 01:39:51,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:39:51,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 01:39:51,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:39:51,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 01:39:51,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-12 01:39:51,299 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 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.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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-12 01:39:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:39:52,315 INFO L93 Difference]: Finished difference Result 236 states and 392 transitions. [2024-11-12 01:39:52,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 01:39:52,318 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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 119 [2024-11-12 01:39:52,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:39:52,331 INFO L225 Difference]: With dead ends: 236 [2024-11-12 01:39:52,331 INFO L226 Difference]: Without dead ends: 178 [2024-11-12 01:39:52,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-12 01:39:52,341 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 213 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 01:39:52,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 433 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 01:39:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-12 01:39:52,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 102. [2024-11-12 01:39:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 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-12 01:39:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2024-11-12 01:39:52,406 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2024-11-12 01:39:52,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:39:52,407 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2024-11-12 01:39:52,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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-12 01:39:52,408 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2024-11-12 01:39:52,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 01:39:52,412 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:39:52,412 INFO L218 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] [2024-11-12 01:39:52,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:39:52,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:39:52,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:39:52,413 INFO L85 PathProgramCache]: Analyzing trace with hash 40097505, now seen corresponding path program 1 times [2024-11-12 01:39:52,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:39:52,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724600592] [2024-11-12 01:39:52,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:39:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:39:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:39:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:39:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:39:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:39:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:39:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:39:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:39:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:39:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:39:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:39:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:39:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:39:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:39:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:39:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:39:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:39:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:39:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:39:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:39:56,978 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-12 01:39:56,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:39:56,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724600592] [2024-11-12 01:39:56,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724600592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:39:56,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:39:56,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 01:39:56,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135647289] [2024-11-12 01:39:56,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:39:56,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 01:39:56,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:39:56,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 01:39:56,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-12 01:39:56,983 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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-12 01:39:58,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:39:58,655 INFO L93 Difference]: Finished difference Result 178 states and 242 transitions. [2024-11-12 01:39:58,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 01:39:58,656 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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 119 [2024-11-12 01:39:58,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:39:58,660 INFO L225 Difference]: With dead ends: 178 [2024-11-12 01:39:58,660 INFO L226 Difference]: Without dead ends: 176 [2024-11-12 01:39:58,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-12 01:39:58,666 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 186 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 01:39:58,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 534 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 01:39:58,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-12 01:39:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 102. [2024-11-12 01:39:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 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-12 01:39:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2024-11-12 01:39:58,695 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2024-11-12 01:39:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:39:58,695 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2024-11-12 01:39:58,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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-12 01:39:58,696 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2024-11-12 01:39:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 01:39:58,700 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:39:58,700 INFO L218 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] [2024-11-12 01:39:58,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:39:58,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:39:58,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:39:58,704 INFO L85 PathProgramCache]: Analyzing trace with hash 718308833, now seen corresponding path program 1 times [2024-11-12 01:39:58,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:39:58,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505352230] [2024-11-12 01:39:58,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:39:58,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:39:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:40:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:40:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:40:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:40:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:40:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:40:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:40:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:40:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:40:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:40:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:40:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:40:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:40:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:40:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:40:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:40:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:40:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:40:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:02,647 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-12 01:40:02,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:40:02,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505352230] [2024-11-12 01:40:02,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505352230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:40:02,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:40:02,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 01:40:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306815969] [2024-11-12 01:40:02,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:40:02,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 01:40:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:40:02,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 01:40:02,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-12 01:40:02,652 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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-12 01:40:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:40:03,468 INFO L93 Difference]: Finished difference Result 185 states and 250 transitions. [2024-11-12 01:40:03,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 01:40:03,468 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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 119 [2024-11-12 01:40:03,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:40:03,470 INFO L225 Difference]: With dead ends: 185 [2024-11-12 01:40:03,470 INFO L226 Difference]: Without dead ends: 183 [2024-11-12 01:40:03,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-12 01:40:03,472 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 219 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 01:40:03,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 432 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 01:40:03,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-12 01:40:03,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 106. [2024-11-12 01:40:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 82 states have internal predecessors, (114), 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-12 01:40:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 158 transitions. [2024-11-12 01:40:03,489 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 158 transitions. Word has length 119 [2024-11-12 01:40:03,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:40:03,490 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 158 transitions. [2024-11-12 01:40:03,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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-12 01:40:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 158 transitions. [2024-11-12 01:40:03,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 01:40:03,492 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:40:03,492 INFO L218 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] [2024-11-12 01:40:03,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 01:40:03,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:40:03,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:40:03,493 INFO L85 PathProgramCache]: Analyzing trace with hash 720155875, now seen corresponding path program 1 times [2024-11-12 01:40:03,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:40:03,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99115110] [2024-11-12 01:40:03,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:40:03,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:40:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:40:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:40:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:40:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:40:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:40:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:40:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:40:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:40:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:40:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:40:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:40:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:40:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:40:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:40:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:40:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:40:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:40:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:40:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:08,040 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-12 01:40:08,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:40:08,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99115110] [2024-11-12 01:40:08,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99115110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:40:08,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:40:08,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 01:40:08,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042275697] [2024-11-12 01:40:08,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:40:08,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 01:40:08,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:40:08,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 01:40:08,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-12 01:40:08,042 INFO L87 Difference]: Start difference. First operand 106 states and 158 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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-12 01:40:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:40:09,432 INFO L93 Difference]: Finished difference Result 183 states and 248 transitions. [2024-11-12 01:40:09,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 01:40:09,433 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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 119 [2024-11-12 01:40:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:40:09,434 INFO L225 Difference]: With dead ends: 183 [2024-11-12 01:40:09,434 INFO L226 Difference]: Without dead ends: 181 [2024-11-12 01:40:09,434 INFO L434 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-12 01:40:09,435 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 193 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 01:40:09,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 513 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 01:40:09,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-12 01:40:09,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 102. [2024-11-12 01:40:09,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 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-12 01:40:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2024-11-12 01:40:09,450 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2024-11-12 01:40:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:40:09,451 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2024-11-12 01:40:09,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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-12 01:40:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2024-11-12 01:40:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 01:40:09,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:40:09,453 INFO L218 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] [2024-11-12 01:40:09,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 01:40:09,453 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:40:09,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:40:09,454 INFO L85 PathProgramCache]: Analyzing trace with hash 296415901, now seen corresponding path program 1 times [2024-11-12 01:40:09,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:40:09,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040415703] [2024-11-12 01:40:09,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:40:09,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:40:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:40:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:40:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:40:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:40:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:40:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:40:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:40:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:40:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:40:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:40:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:40:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:40:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:40:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:40:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:40:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:40:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:40:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:40:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,533 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-12 01:40:09,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:40:09,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040415703] [2024-11-12 01:40:09,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040415703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:40:09,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:40:09,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:40:09,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020314929] [2024-11-12 01:40:09,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:40:09,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:40:09,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:40:09,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:40:09,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:40:09,536 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-12 01:40:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:40:09,579 INFO L93 Difference]: Finished difference Result 281 states and 422 transitions. [2024-11-12 01:40:09,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:40:09,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 119 [2024-11-12 01:40:09,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:40:09,586 INFO L225 Difference]: With dead ends: 281 [2024-11-12 01:40:09,587 INFO L226 Difference]: Without dead ends: 182 [2024-11-12 01:40:09,588 INFO L434 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-12 01:40:09,589 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 73 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 222 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-12 01:40:09,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 222 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:40:09,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-12 01:40:09,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2024-11-12 01:40:09,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 133 states have internal predecessors, (174), 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-12 01:40:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 262 transitions. [2024-11-12 01:40:09,632 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 262 transitions. Word has length 119 [2024-11-12 01:40:09,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:40:09,634 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 262 transitions. [2024-11-12 01:40:09,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-12 01:40:09,635 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 262 transitions. [2024-11-12 01:40:09,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 01:40:09,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:40:09,637 INFO L218 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] [2024-11-12 01:40:09,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 01:40:09,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:40:09,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:40:09,637 INFO L85 PathProgramCache]: Analyzing trace with hash -512930725, now seen corresponding path program 1 times [2024-11-12 01:40:09,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:40:09,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180939972] [2024-11-12 01:40:09,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:40:09,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:40:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:40:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:40:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:40:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:40:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:40:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:40:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:40:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:40:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:40:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:40:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:40:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:40:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:40:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:40:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:40:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:40:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:40:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:40:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:09,786 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-12 01:40:09,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:40:09,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180939972] [2024-11-12 01:40:09,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180939972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:40:09,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:40:09,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:40:09,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669968924] [2024-11-12 01:40:09,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:40:09,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:40:09,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:40:09,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:40:09,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:40:09,789 INFO L87 Difference]: Start difference. First operand 180 states and 262 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-12 01:40:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:40:09,974 INFO L93 Difference]: Finished difference Result 530 states and 761 transitions. [2024-11-12 01:40:09,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:40:09,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 119 [2024-11-12 01:40:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:40:09,978 INFO L225 Difference]: With dead ends: 530 [2024-11-12 01:40:09,978 INFO L226 Difference]: Without dead ends: 353 [2024-11-12 01:40:09,982 INFO L434 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-12 01:40:09,984 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 71 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 263 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-12 01:40:09,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 263 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 01:40:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-12 01:40:10,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 308. [2024-11-12 01:40:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 218 states have internal predecessors, (279), 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-12 01:40:10,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 447 transitions. [2024-11-12 01:40:10,041 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 447 transitions. Word has length 119 [2024-11-12 01:40:10,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:40:10,042 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 447 transitions. [2024-11-12 01:40:10,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-12 01:40:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 447 transitions. [2024-11-12 01:40:10,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 01:40:10,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:40:10,045 INFO L218 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] [2024-11-12 01:40:10,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 01:40:10,046 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:40:10,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:40:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash 167127645, now seen corresponding path program 1 times [2024-11-12 01:40:10,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:40:10,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741617594] [2024-11-12 01:40:10,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:40:10,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:40:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:40:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:40:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:40:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:40:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:40:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:40:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:40:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:40:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:40:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:40:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:40:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:40:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:40:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:40:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:40:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:40:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:40:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:40:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:11,995 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-12 01:40:11,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:40:11,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741617594] [2024-11-12 01:40:11,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741617594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:40:11,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:40:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 01:40:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617107006] [2024-11-12 01:40:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:40:11,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 01:40:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:40:11,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 01:40:11,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-12 01:40:11,997 INFO L87 Difference]: Start difference. First operand 308 states and 447 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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-12 01:40:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:40:12,823 INFO L93 Difference]: Finished difference Result 454 states and 614 transitions. [2024-11-12 01:40:12,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 01:40:12,824 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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 119 [2024-11-12 01:40:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:40:12,828 INFO L225 Difference]: With dead ends: 454 [2024-11-12 01:40:12,828 INFO L226 Difference]: Without dead ends: 452 [2024-11-12 01:40:12,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-12 01:40:12,829 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 243 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 01:40:12,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 507 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 01:40:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-12 01:40:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 364. [2024-11-12 01:40:12,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 260 states have (on average 1.2769230769230768) internal successors, (332), 265 states have internal predecessors, (332), 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-12 01:40:12,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 516 transitions. [2024-11-12 01:40:12,879 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 516 transitions. Word has length 119 [2024-11-12 01:40:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:40:12,880 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 516 transitions. [2024-11-12 01:40:12,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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-12 01:40:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 516 transitions. [2024-11-12 01:40:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 01:40:12,881 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:40:12,881 INFO L218 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] [2024-11-12 01:40:12,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 01:40:12,882 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:40:12,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:40:12,882 INFO L85 PathProgramCache]: Analyzing trace with hash 168974687, now seen corresponding path program 1 times [2024-11-12 01:40:12,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:40:12,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814662716] [2024-11-12 01:40:12,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:40:12,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:40:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:40:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:40:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:40:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:40:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:40:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:40:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:40:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:40:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:40:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:40:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:40:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:40:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:40:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:40:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:40:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:40:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:40:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:40:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:15,774 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-12 01:40:15,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:40:15,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814662716] [2024-11-12 01:40:15,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814662716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:40:15,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:40:15,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 01:40:15,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398133617] [2024-11-12 01:40:15,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:40:15,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 01:40:15,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:40:15,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 01:40:15,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-12 01:40:15,777 INFO L87 Difference]: Start difference. First operand 364 states and 516 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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-12 01:40:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:40:17,228 INFO L93 Difference]: Finished difference Result 452 states and 612 transitions. [2024-11-12 01:40:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 01:40:17,229 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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 119 [2024-11-12 01:40:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:40:17,232 INFO L225 Difference]: With dead ends: 452 [2024-11-12 01:40:17,232 INFO L226 Difference]: Without dead ends: 450 [2024-11-12 01:40:17,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-12 01:40:17,233 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 288 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 01:40:17,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 543 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 01:40:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-12 01:40:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 364. [2024-11-12 01:40:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 260 states have (on average 1.2769230769230768) internal successors, (332), 265 states have internal predecessors, (332), 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-12 01:40:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 516 transitions. [2024-11-12 01:40:17,300 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 516 transitions. Word has length 119 [2024-11-12 01:40:17,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:40:17,301 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 516 transitions. [2024-11-12 01:40:17,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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-12 01:40:17,301 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 516 transitions. [2024-11-12 01:40:17,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 01:40:17,303 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:40:17,303 INFO L218 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] [2024-11-12 01:40:17,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 01:40:17,303 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:40:17,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:40:17,304 INFO L85 PathProgramCache]: Analyzing trace with hash -548555551, now seen corresponding path program 1 times [2024-11-12 01:40:17,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:40:17,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756428545] [2024-11-12 01:40:17,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:40:17,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:40:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:40:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:40:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:40:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:40:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:40:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:40:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:40:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:40:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:40:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:40:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:40:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:40:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:40:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:40:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:40:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:40:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:40:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:40:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:17,594 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-12 01:40:17,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:40:17,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756428545] [2024-11-12 01:40:17,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756428545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:40:17,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:40:17,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:40:17,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74965748] [2024-11-12 01:40:17,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:40:17,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:40:17,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:40:17,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:40:17,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:40:17,598 INFO L87 Difference]: Start difference. First operand 364 states and 516 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-12 01:40:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:40:17,842 INFO L93 Difference]: Finished difference Result 689 states and 965 transitions. [2024-11-12 01:40:17,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:40:17,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 119 [2024-11-12 01:40:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:40:17,846 INFO L225 Difference]: With dead ends: 689 [2024-11-12 01:40:17,848 INFO L226 Difference]: Without dead ends: 371 [2024-11-12 01:40:17,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 01:40:17,850 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 125 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 166 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.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:40:17,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 166 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:40:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-12 01:40:17,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 362. [2024-11-12 01:40:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 252 states have (on average 1.2341269841269842) internal successors, (311), 257 states have internal predecessors, (311), 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-12 01:40:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 503 transitions. [2024-11-12 01:40:17,897 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 503 transitions. Word has length 119 [2024-11-12 01:40:17,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:40:17,900 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 503 transitions. [2024-11-12 01:40:17,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-12 01:40:17,901 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 503 transitions. [2024-11-12 01:40:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 01:40:17,902 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:40:17,902 INFO L218 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] [2024-11-12 01:40:17,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 01:40:17,902 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:40:17,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:40:17,903 INFO L85 PathProgramCache]: Analyzing trace with hash 306968243, now seen corresponding path program 1 times [2024-11-12 01:40:17,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:40:17,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336572666] [2024-11-12 01:40:17,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:40:17,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:40:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:40:17,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [56583221] [2024-11-12 01:40:17,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:40:17,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:40:17,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:40:17,988 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-12 01:40:17,992 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-12 01:40:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:18,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 01:40:18,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:40:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 93 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-12 01:40:19,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:40:20,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:40:20,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336572666] [2024-11-12 01:40:20,040 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 01:40:20,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56583221] [2024-11-12 01:40:20,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56583221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:40:20,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 01:40:20,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2024-11-12 01:40:20,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94322803] [2024-11-12 01:40:20,042 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 01:40:20,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 01:40:20,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:40:20,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 01:40:20,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-11-12 01:40:20,044 INFO L87 Difference]: Start difference. First operand 362 states and 503 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-12 01:40:20,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:40:20,939 INFO L93 Difference]: Finished difference Result 985 states and 1261 transitions. [2024-11-12 01:40:20,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-12 01:40:20,940 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 120 [2024-11-12 01:40:20,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:40:20,946 INFO L225 Difference]: With dead ends: 985 [2024-11-12 01:40:20,946 INFO L226 Difference]: Without dead ends: 667 [2024-11-12 01:40:20,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=973, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 01:40:20,949 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 136 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 50 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 01:40:20,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 285 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 437 Invalid, 2 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 01:40:20,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-11-12 01:40:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 553. [2024-11-12 01:40:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 386 states have (on average 1.1580310880829014) internal successors, (447), 397 states have internal predecessors, (447), 124 states have call successors, (124), 42 states have call predecessors, (124), 42 states have return successors, (124), 113 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-12 01:40:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 695 transitions. [2024-11-12 01:40:21,045 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 695 transitions. Word has length 120 [2024-11-12 01:40:21,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:40:21,046 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 695 transitions. [2024-11-12 01:40:21,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-12 01:40:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 695 transitions. [2024-11-12 01:40:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 01:40:21,047 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:40:21,047 INFO L218 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] [2024-11-12 01:40:21,069 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-12 01:40:21,248 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-12 01:40:21,248 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:40:21,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:40:21,249 INFO L85 PathProgramCache]: Analyzing trace with hash 308815285, now seen corresponding path program 1 times [2024-11-12 01:40:21,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:40:21,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852843311] [2024-11-12 01:40:21,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:40:21,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:40:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:40:21,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [905211569] [2024-11-12 01:40:21,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:40:21,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:40:21,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:40:21,331 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-12 01:40:21,334 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-12 01:40:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:40:21,469 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:40:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:40:21,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:40:21,584 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:40:21,585 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:40:21,606 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-12 01:40:21,787 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-12 01:40:21,790 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:40:21,888 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:40:21,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:40:21 BoogieIcfgContainer [2024-11-12 01:40:21,890 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:40:21,891 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:40:21,891 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:40:21,891 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:40:21,892 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:39:46" (3/4) ... [2024-11-12 01:40:21,894 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:40:21,895 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:40:21,896 INFO L158 Benchmark]: Toolchain (without parser) took 36835.05ms. Allocated memory was 146.8MB in the beginning and 599.8MB in the end (delta: 453.0MB). Free memory was 89.7MB in the beginning and 346.4MB in the end (delta: -256.6MB). Peak memory consumption was 198.9MB. Max. memory is 16.1GB. [2024-11-12 01:40:21,896 INFO L158 Benchmark]: CDTParser took 1.78ms. Allocated memory is still 146.8MB. Free memory is still 108.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:40:21,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.43ms. Allocated memory is still 146.8MB. Free memory was 89.3MB in the beginning and 74.5MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 01:40:21,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.08ms. Allocated memory is still 146.8MB. Free memory was 74.5MB in the beginning and 71.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:40:21,897 INFO L158 Benchmark]: Boogie Preprocessor took 73.99ms. Allocated memory is still 146.8MB. Free memory was 71.1MB in the beginning and 66.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:40:21,897 INFO L158 Benchmark]: RCFGBuilder took 512.46ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 66.4MB in the beginning and 161.6MB in the end (delta: -95.2MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-11-12 01:40:21,898 INFO L158 Benchmark]: TraceAbstraction took 35851.38ms. Allocated memory was 199.2MB in the beginning and 599.8MB in the end (delta: 400.6MB). Free memory was 160.5MB in the beginning and 347.4MB in the end (delta: -186.9MB). Peak memory consumption was 213.7MB. Max. memory is 16.1GB. [2024-11-12 01:40:21,898 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 599.8MB. Free memory was 347.4MB in the beginning and 346.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:40:21,899 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.78ms. Allocated memory is still 146.8MB. Free memory is still 108.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.43ms. Allocated memory is still 146.8MB. Free memory was 89.3MB in the beginning and 74.5MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.08ms. Allocated memory is still 146.8MB. Free memory was 74.5MB in the beginning and 71.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.99ms. Allocated memory is still 146.8MB. Free memory was 71.1MB in the beginning and 66.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 512.46ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 66.4MB in the beginning and 161.6MB in the end (delta: -95.2MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * TraceAbstraction took 35851.38ms. Allocated memory was 199.2MB in the beginning and 599.8MB in the end (delta: 400.6MB). Free memory was 160.5MB in the beginning and 347.4MB in the end (delta: -186.9MB). Peak memory consumption was 213.7MB. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 599.8MB. Free memory was 347.4MB in the beginning and 346.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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=-63, 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=-63, 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=-63, 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=-63, 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=-63, 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=-63, 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=-63, var_1_4=63, 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=-63, var_1_4=63, 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=-63, var_1_4=63, 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=-63, var_1_4=63, 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=-63, var_1_4=63, 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=-63, var_1_4=63, 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=-63, var_1_4=63, 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=-63, var_1_4=63, 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=-63, var_1_4=63, 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=-63, var_1_4=63, 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=-63, var_1_4=63, 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=-63, var_1_4=63, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, 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=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, 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=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, 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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, 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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, 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=49150, var_1_11=49278, 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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L52] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_2=127, var_1_10=49150, var_1_11=49278, 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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [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=49150, var_1_11=49278, 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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [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=49150, var_1_11=49278, 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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [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=49150, var_1_11=49278, 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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [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=49150, var_1_11=49278, 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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [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=49150, var_1_11=49278, 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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [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=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-126, var_1_19=25, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [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=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [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=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [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=49279, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L83] COND FALSE !(var_1_19 > stepLocal_3) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [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=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [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=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.7s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1752 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1747 mSDsluCounter, 3898 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2965 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3381 IncrementalHoareTripleChecker+Invalid, 3533 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 933 mSDtfsCounter, 3381 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 598 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=553occurred in iteration=10, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 650 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 24.5s InterpolantComputationTime, 1551 NumberOfCodeBlocks, 1551 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1181 ConstructedInterpolants, 1 QuantifiedInterpolants, 12305 SizeOfPredicates, 7 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 6027/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-12 01:40:22,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:40:24,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:40:24,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:40:24,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:40:24,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:40:24,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:40:24,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:40:24,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:40:24,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:40:24,364 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:40:24,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:40:24,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:40:24,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:40:24,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:40:24,368 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:40:24,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:40:24,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:40:24,369 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:40:24,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:40:24,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:40:24,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:40:24,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:40:24,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:40:24,372 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:40:24,372 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:40:24,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:40:24,373 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:40:24,373 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:40:24,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:40:24,373 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:40:24,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:40:24,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:40:24,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:40:24,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:40:24,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:40:24,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:40:24,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:40:24,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:40:24,378 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:40:24,379 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:40:24,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:40:24,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:40:24,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:40:24,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:40:24,380 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-12 01:40:24,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:40:24,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:40:24,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:40:24,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:40:24,724 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:40:24,726 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-12 01:40:26,300 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:40:26,513 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:40:26,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-66.i [2024-11-12 01:40:26,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c97a088/52d15000a7354556acecbd79a2ba1f7e/FLAG12b96a794 [2024-11-12 01:40:26,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c97a088/52d15000a7354556acecbd79a2ba1f7e [2024-11-12 01:40:26,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:40:26,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:40:26,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:40:26,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:40:26,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:40:26,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:40:26" (1/1) ... [2024-11-12 01:40:26,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64232d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:26, skipping insertion in model container [2024-11-12 01:40:26,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:40:26" (1/1) ... [2024-11-12 01:40:26,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:40:26,763 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-12 01:40:26,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:40:26,855 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:40:26,870 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-12 01:40:26,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:40:26,930 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:40:26,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:26 WrapperNode [2024-11-12 01:40:26,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:40:26,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:40:26,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:40:26,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:40:26,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:26" (1/1) ... [2024-11-12 01:40:26,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:26" (1/1) ... [2024-11-12 01:40:26,995 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-12 01:40:26,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:40:27,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:40:27,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:40:27,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:40:27,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:26" (1/1) ... [2024-11-12 01:40:27,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:26" (1/1) ... [2024-11-12 01:40:27,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:26" (1/1) ... [2024-11-12 01:40:27,038 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-12 01:40:27,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:26" (1/1) ... [2024-11-12 01:40:27,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:26" (1/1) ... [2024-11-12 01:40:27,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:26" (1/1) ... [2024-11-12 01:40:27,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:26" (1/1) ... [2024-11-12 01:40:27,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:26" (1/1) ... [2024-11-12 01:40:27,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:26" (1/1) ... [2024-11-12 01:40:27,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:40:27,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:40:27,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:40:27,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:40:27,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:26" (1/1) ... [2024-11-12 01:40:27,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:40:27,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:40:27,106 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-12 01:40:27,109 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-12 01:40:27,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:40:27,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:40:27,158 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:40:27,158 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:40:27,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:40:27,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:40:27,256 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:40:27,259 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:40:27,614 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-12 01:40:27,614 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:40:27,627 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:40:27,627 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:40:27,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:40:27 BoogieIcfgContainer [2024-11-12 01:40:27,628 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:40:27,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:40:27,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:40:27,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:40:27,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:40:26" (1/3) ... [2024-11-12 01:40:27,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5aa40d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:40:27, skipping insertion in model container [2024-11-12 01:40:27,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:40:26" (2/3) ... [2024-11-12 01:40:27,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5aa40d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:40:27, skipping insertion in model container [2024-11-12 01:40:27,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:40:27" (3/3) ... [2024-11-12 01:40:27,638 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-66.i [2024-11-12 01:40:27,655 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:40:27,655 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:40:27,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:40:27,727 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;@1c4de10f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:40:27,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:40:27,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 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-12 01:40:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 01:40:27,744 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:40:27,745 INFO L218 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] [2024-11-12 01:40:27,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:40:27,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:40:27,752 INFO L85 PathProgramCache]: Analyzing trace with hash 38250463, now seen corresponding path program 1 times [2024-11-12 01:40:27,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:40:27,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773067477] [2024-11-12 01:40:27,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:40:27,774 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-12 01:40:27,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:40:27,778 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-12 01:40:27,780 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-12 01:40:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:28,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 01:40:28,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:40:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 406 proven. 78 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-12 01:40:30,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:40:34,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:40:34,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773067477] [2024-11-12 01:40:34,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773067477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:40:34,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1546680651] [2024-11-12 01:40:34,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:40:34,040 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 01:40:34,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 01:40:34,043 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 01:40:34,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-12 01:40:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:40:34,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 01:40:34,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:40:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 388 proven. 72 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-12 01:40:42,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:40:50,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1546680651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:40:50,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 01:40:50,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2024-11-12 01:40:50,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868535491] [2024-11-12 01:40:50,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 01:40:50,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 01:40:50,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:40:50,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 01:40:50,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=650, Unknown=1, NotChecked=0, Total=756 [2024-11-12 01:40:50,395 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 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 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 states have internal predecessors, (83), 7 states have call successors, (31), 7 states have call predecessors, (31), 12 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32)