./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.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 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:38:57,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:38:57,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:38:57,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:38:57,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:38:57,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:38:57,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:38:57,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:38:57,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:38:57,905 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:38:57,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:38:57,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:38:57,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:38:57,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:38:57,907 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:38:57,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:38:57,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:38:57,908 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:38:57,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:38:57,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:38:57,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:38:57,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:38:57,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:38:57,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:38:57,910 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:38:57,910 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:38:57,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:38:57,911 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:38:57,911 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:38:57,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:38:57,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:38:57,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:38:57,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:38:57,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:38:57,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:38:57,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:38:57,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:38:57,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:38:57,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:38:57,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:38:57,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:38:57,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:38:57,916 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 -> 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf [2024-10-24 08:38:58,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:38:58,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:38:58,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:38:58,180 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:38:58,181 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:38:58,182 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i [2024-10-24 08:38:59,443 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:38:59,605 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:38:59,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i [2024-10-24 08:38:59,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c958c9e82/c05ca0bd526f4771b339b9a6d3dd3f0a/FLAG23417b55a [2024-10-24 08:38:59,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c958c9e82/c05ca0bd526f4771b339b9a6d3dd3f0a [2024-10-24 08:38:59,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:38:59,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:38:59,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:38:59,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:38:59,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:38:59,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:38:59" (1/1) ... [2024-10-24 08:38:59,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28cb105b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:38:59, skipping insertion in model container [2024-10-24 08:38:59,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:38:59" (1/1) ... [2024-10-24 08:38:59,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:38:59,787 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i[913,926] [2024-10-24 08:38:59,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:38:59,851 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:38:59,862 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i[913,926] [2024-10-24 08:38:59,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:38:59,922 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:38:59,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:38:59 WrapperNode [2024-10-24 08:38:59,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:38:59,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:38:59,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:38:59,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:38:59,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:38:59" (1/1) ... [2024-10-24 08:38:59,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:38:59" (1/1) ... [2024-10-24 08:38:59,983 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-24 08:38:59,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:38:59,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:38:59,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:38:59,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:38:59,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:38:59" (1/1) ... [2024-10-24 08:38:59,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:38:59" (1/1) ... [2024-10-24 08:39:00,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:38:59" (1/1) ... [2024-10-24 08:39:00,021 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:39:00,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:38:59" (1/1) ... [2024-10-24 08:39:00,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:38:59" (1/1) ... [2024-10-24 08:39:00,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:38:59" (1/1) ... [2024-10-24 08:39:00,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:38:59" (1/1) ... [2024-10-24 08:39:00,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:38:59" (1/1) ... [2024-10-24 08:39:00,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:38:59" (1/1) ... [2024-10-24 08:39:00,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:39:00,047 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:39:00,047 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:39:00,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:39:00,048 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:38:59" (1/1) ... [2024-10-24 08:39:00,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:39:00,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:39:00,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:39:00,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:39:00,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:39:00,122 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:39:00,123 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:39:00,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:39:00,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:39:00,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:39:00,215 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:39:00,226 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:39:00,580 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-24 08:39:00,580 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:39:00,612 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:39:00,614 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:39:00,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:39:00 BoogieIcfgContainer [2024-10-24 08:39:00,614 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:39:00,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:39:00,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:39:00,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:39:00,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:38:59" (1/3) ... [2024-10-24 08:39:00,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c262b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:39:00, skipping insertion in model container [2024-10-24 08:39:00,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:38:59" (2/3) ... [2024-10-24 08:39:00,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c262b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:39:00, skipping insertion in model container [2024-10-24 08:39:00,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:39:00" (3/3) ... [2024-10-24 08:39:00,624 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-84.i [2024-10-24 08:39:00,637 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:39:00,638 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:39:00,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:39:00,688 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;@5cf7573a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:39:00,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:39:00,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 08:39:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 08:39:00,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:00,707 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:00,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:00,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:00,713 INFO L85 PathProgramCache]: Analyzing trace with hash 313342948, now seen corresponding path program 1 times [2024-10-24 08:39:00,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:00,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034260] [2024-10-24 08:39:00,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:00,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:00,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:00,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:00,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:00,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:00,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:39:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:00,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:00,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:39:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:00,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:00,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:00,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:00,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:39:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:00,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 08:39:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:00,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:39:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:00,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 08:39:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 08:39:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 08:39:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 08:39:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 08:39:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 08:39:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 08:39:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 08:39:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 08:39:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:39:01,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:01,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034260] [2024-10-24 08:39:01,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:01,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:01,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:39:01,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928933112] [2024-10-24 08:39:01,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:01,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:39:01,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:01,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:39:01,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:39:01,078 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 08:39:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:01,112 INFO L93 Difference]: Finished difference Result 147 states and 254 transitions. [2024-10-24 08:39:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:39:01,118 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2024-10-24 08:39:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:01,124 INFO L225 Difference]: With dead ends: 147 [2024-10-24 08:39:01,124 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 08:39:01,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:39:01,129 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:01,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:39:01,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 08:39:01,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 08:39:01,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 08:39:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2024-10-24 08:39:01,166 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 141 [2024-10-24 08:39:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:01,167 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2024-10-24 08:39:01,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 08:39:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2024-10-24 08:39:01,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 08:39:01,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:01,170 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:01,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:39:01,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:01,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:01,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1808792156, now seen corresponding path program 1 times [2024-10-24 08:39:01,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:01,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253279511] [2024-10-24 08:39:01,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:01,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:39:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:39:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:39:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 08:39:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:39:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 08:39:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 08:39:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 08:39:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 08:39:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 08:39:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 08:39:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 08:39:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 08:39:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 08:39:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:39:01,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:01,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253279511] [2024-10-24 08:39:01,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253279511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:01,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:01,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:39:01,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547577696] [2024-10-24 08:39:01,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:01,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:39:01,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:01,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:39:01,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:39:01,617 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:01,651 INFO L93 Difference]: Finished difference Result 145 states and 223 transitions. [2024-10-24 08:39:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:39:01,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-10-24 08:39:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:01,653 INFO L225 Difference]: With dead ends: 145 [2024-10-24 08:39:01,653 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 08:39:01,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:39:01,655 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:01,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 106 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:39:01,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 08:39:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 08:39:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 08:39:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2024-10-24 08:39:01,668 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 141 [2024-10-24 08:39:01,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:01,669 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2024-10-24 08:39:01,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2024-10-24 08:39:01,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 08:39:01,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:01,672 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:01,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:39:01,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:01,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:01,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1107727578, now seen corresponding path program 1 times [2024-10-24 08:39:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:01,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456583472] [2024-10-24 08:39:01,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:01,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:39:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:39:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:39:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 08:39:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:39:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 08:39:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 08:39:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 08:39:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 08:39:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 08:39:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 08:39:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 08:39:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 08:39:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 08:39:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:39:04,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:04,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456583472] [2024-10-24 08:39:04,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456583472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:04,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:04,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 08:39:04,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601110408] [2024-10-24 08:39:04,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:04,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 08:39:04,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:04,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 08:39:04,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 08:39:04,302 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:05,017 INFO L93 Difference]: Finished difference Result 178 states and 265 transitions. [2024-10-24 08:39:05,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 08:39:05,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-10-24 08:39:05,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:05,020 INFO L225 Difference]: With dead ends: 178 [2024-10-24 08:39:05,020 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 08:39:05,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:39:05,024 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 37 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:05,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 417 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 08:39:05,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 08:39:05,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2024-10-24 08:39:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 75 states have internal predecessors, (100), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 08:39:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-10-24 08:39:05,037 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 141 [2024-10-24 08:39:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:05,037 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-10-24 08:39:05,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-10-24 08:39:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 08:39:05,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:05,042 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:05,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:39:05,043 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:05,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:05,043 INFO L85 PathProgramCache]: Analyzing trace with hash 141776580, now seen corresponding path program 1 times [2024-10-24 08:39:05,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:05,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881674157] [2024-10-24 08:39:05,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:05,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:39:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:39:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:39:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 08:39:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:39:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 08:39:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 08:39:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 08:39:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 08:39:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 08:39:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 08:39:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 08:39:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 08:39:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 08:39:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:39:08,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:08,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881674157] [2024-10-24 08:39:08,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881674157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:08,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:08,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 08:39:08,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165334412] [2024-10-24 08:39:08,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:08,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:39:08,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:08,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:39:08,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:39:08,472 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:08,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:08,946 INFO L93 Difference]: Finished difference Result 243 states and 351 transitions. [2024-10-24 08:39:08,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 08:39:08,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-10-24 08:39:08,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:08,953 INFO L225 Difference]: With dead ends: 243 [2024-10-24 08:39:08,955 INFO L226 Difference]: Without dead ends: 141 [2024-10-24 08:39:08,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:39:08,956 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 97 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:08,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 382 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 08:39:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-24 08:39:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-10-24 08:39:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 105 states have internal predecessors, (136), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 08:39:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 196 transitions. [2024-10-24 08:39:08,976 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 196 transitions. Word has length 142 [2024-10-24 08:39:08,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:08,977 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 196 transitions. [2024-10-24 08:39:08,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:08,977 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 196 transitions. [2024-10-24 08:39:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 08:39:08,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:08,978 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:08,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:39:08,978 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:08,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:08,979 INFO L85 PathProgramCache]: Analyzing trace with hash -445029434, now seen corresponding path program 1 times [2024-10-24 08:39:08,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:08,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448542788] [2024-10-24 08:39:08,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:08,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:39:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:39:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:39:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 08:39:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:39:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 08:39:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 08:39:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 08:39:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 08:39:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 08:39:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 08:39:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 08:39:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 08:39:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 08:39:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:39:09,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:09,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448542788] [2024-10-24 08:39:09,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448542788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:09,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:09,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 08:39:09,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912036145] [2024-10-24 08:39:09,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:09,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 08:39:09,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:09,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 08:39:09,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 08:39:09,409 INFO L87 Difference]: Start difference. First operand 137 states and 196 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:09,680 INFO L93 Difference]: Finished difference Result 274 states and 389 transitions. [2024-10-24 08:39:09,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 08:39:09,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-10-24 08:39:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:09,682 INFO L225 Difference]: With dead ends: 274 [2024-10-24 08:39:09,682 INFO L226 Difference]: Without dead ends: 145 [2024-10-24 08:39:09,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:39:09,687 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 40 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:09,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 462 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:39:09,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-24 08:39:09,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 114. [2024-10-24 08:39:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 81 states have (on average 1.308641975308642) internal successors, (106), 83 states have internal predecessors, (106), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 08:39:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-10-24 08:39:09,705 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 142 [2024-10-24 08:39:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:09,709 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-10-24 08:39:09,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-10-24 08:39:09,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-24 08:39:09,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:09,710 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:09,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 08:39:09,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:09,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:09,711 INFO L85 PathProgramCache]: Analyzing trace with hash -6372629, now seen corresponding path program 1 times [2024-10-24 08:39:09,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:09,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066089249] [2024-10-24 08:39:09,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:09,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:39:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:39:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:39:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 08:39:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:39:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 08:39:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 08:39:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 08:39:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 08:39:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 08:39:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 08:39:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 08:39:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 08:39:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 08:39:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:39:12,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:12,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066089249] [2024-10-24 08:39:12,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066089249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:12,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:12,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 08:39:12,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954854070] [2024-10-24 08:39:12,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:12,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 08:39:12,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:12,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 08:39:12,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:39:12,421 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:13,339 INFO L93 Difference]: Finished difference Result 351 states and 493 transitions. [2024-10-24 08:39:13,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 08:39:13,344 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-24 08:39:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:13,346 INFO L225 Difference]: With dead ends: 351 [2024-10-24 08:39:13,346 INFO L226 Difference]: Without dead ends: 245 [2024-10-24 08:39:13,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-24 08:39:13,348 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 186 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:13,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 587 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 08:39:13,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-24 08:39:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 145. [2024-10-24 08:39:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 114 states have internal predecessors, (149), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 08:39:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-10-24 08:39:13,363 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 143 [2024-10-24 08:39:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:13,363 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-10-24 08:39:13,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-10-24 08:39:13,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-24 08:39:13,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:13,365 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:13,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 08:39:13,365 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:13,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:13,366 INFO L85 PathProgramCache]: Analyzing trace with hash -399399639, now seen corresponding path program 1 times [2024-10-24 08:39:13,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:13,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852271957] [2024-10-24 08:39:13,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:13,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:39:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:39:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:39:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 08:39:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:39:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 08:39:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 08:39:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 08:39:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 08:39:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 08:39:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 08:39:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 08:39:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 08:39:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 08:39:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:39:15,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:15,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852271957] [2024-10-24 08:39:15,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852271957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:15,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:15,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 08:39:15,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647718988] [2024-10-24 08:39:15,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:15,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 08:39:15,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:15,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 08:39:15,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-24 08:39:15,326 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:16,206 INFO L93 Difference]: Finished difference Result 360 states and 505 transitions. [2024-10-24 08:39:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 08:39:16,209 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-24 08:39:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:16,210 INFO L225 Difference]: With dead ends: 360 [2024-10-24 08:39:16,210 INFO L226 Difference]: Without dead ends: 223 [2024-10-24 08:39:16,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2024-10-24 08:39:16,211 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 286 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:16,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 302 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 08:39:16,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-24 08:39:16,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 145. [2024-10-24 08:39:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 114 states have internal predecessors, (149), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 08:39:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-10-24 08:39:16,232 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 143 [2024-10-24 08:39:16,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:16,232 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-10-24 08:39:16,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-10-24 08:39:16,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-24 08:39:16,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:16,234 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:16,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 08:39:16,234 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:16,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:16,234 INFO L85 PathProgramCache]: Analyzing trace with hash 251792809, now seen corresponding path program 1 times [2024-10-24 08:39:16,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:16,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268909140] [2024-10-24 08:39:16,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:16,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:39:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:39:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:39:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 08:39:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:39:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 08:39:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 08:39:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 08:39:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 08:39:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 08:39:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 08:39:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 08:39:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 08:39:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 08:39:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:39:17,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:17,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268909140] [2024-10-24 08:39:17,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268909140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:17,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:17,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 08:39:17,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111597291] [2024-10-24 08:39:17,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:17,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 08:39:17,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:17,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 08:39:17,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:39:17,611 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:18,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:18,628 INFO L93 Difference]: Finished difference Result 388 states and 542 transitions. [2024-10-24 08:39:18,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 08:39:18,629 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-24 08:39:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:18,630 INFO L225 Difference]: With dead ends: 388 [2024-10-24 08:39:18,630 INFO L226 Difference]: Without dead ends: 251 [2024-10-24 08:39:18,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-24 08:39:18,631 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 94 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:18,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 525 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 08:39:18,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-24 08:39:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 149. [2024-10-24 08:39:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.3362068965517242) internal successors, (155), 118 states have internal predecessors, (155), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 08:39:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 211 transitions. [2024-10-24 08:39:18,646 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 211 transitions. Word has length 143 [2024-10-24 08:39:18,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:18,647 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 211 transitions. [2024-10-24 08:39:18,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 211 transitions. [2024-10-24 08:39:18,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-24 08:39:18,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:18,648 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:18,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 08:39:18,648 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:18,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:18,649 INFO L85 PathProgramCache]: Analyzing trace with hash -141234201, now seen corresponding path program 1 times [2024-10-24 08:39:18,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:18,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806648010] [2024-10-24 08:39:18,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:18,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:39:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:39:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:39:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 08:39:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:39:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 08:39:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 08:39:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 08:39:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 08:39:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 08:39:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 08:39:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 08:39:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 08:39:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 08:39:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:39:20,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:20,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806648010] [2024-10-24 08:39:20,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806648010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:20,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:20,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 08:39:20,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352858691] [2024-10-24 08:39:20,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:20,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 08:39:20,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:20,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 08:39:20,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:39:20,203 INFO L87 Difference]: Start difference. First operand 149 states and 211 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:21,406 INFO L93 Difference]: Finished difference Result 358 states and 503 transitions. [2024-10-24 08:39:21,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 08:39:21,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-24 08:39:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:21,408 INFO L225 Difference]: With dead ends: 358 [2024-10-24 08:39:21,408 INFO L226 Difference]: Without dead ends: 217 [2024-10-24 08:39:21,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-24 08:39:21,409 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 94 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:21,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 575 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 08:39:21,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-24 08:39:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 145. [2024-10-24 08:39:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 114 states have internal predecessors, (149), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 08:39:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-10-24 08:39:21,423 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 143 [2024-10-24 08:39:21,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:21,424 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-10-24 08:39:21,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:21,424 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-10-24 08:39:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 08:39:21,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:21,426 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:21,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 08:39:21,427 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:21,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1282873403, now seen corresponding path program 1 times [2024-10-24 08:39:21,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:21,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928141873] [2024-10-24 08:39:21,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:21,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:39:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:39:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:39:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 08:39:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:39:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 08:39:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 08:39:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 08:39:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 08:39:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 08:39:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 08:39:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 08:39:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 08:39:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 08:39:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:39:21,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:21,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928141873] [2024-10-24 08:39:21,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928141873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:21,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:21,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:39:21,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929553146] [2024-10-24 08:39:21,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:21,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:39:21,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:21,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:39:21,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:39:21,519 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:21,611 INFO L93 Difference]: Finished difference Result 345 states and 485 transitions. [2024-10-24 08:39:21,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:39:21,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-24 08:39:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:21,613 INFO L225 Difference]: With dead ends: 345 [2024-10-24 08:39:21,614 INFO L226 Difference]: Without dead ends: 208 [2024-10-24 08:39:21,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:39:21,615 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 37 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:21,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 158 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:39:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-24 08:39:21,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2024-10-24 08:39:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 147 states have (on average 1.3333333333333333) internal successors, (196), 149 states have internal predecessors, (196), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 08:39:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 252 transitions. [2024-10-24 08:39:21,640 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 252 transitions. Word has length 144 [2024-10-24 08:39:21,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:21,641 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 252 transitions. [2024-10-24 08:39:21,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:21,641 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 252 transitions. [2024-10-24 08:39:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 08:39:21,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:21,642 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:21,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 08:39:21,642 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:21,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:21,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1922919577, now seen corresponding path program 1 times [2024-10-24 08:39:21,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:21,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498886486] [2024-10-24 08:39:21,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:21,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:39:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:39:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:39:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 08:39:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:39:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 08:39:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 08:39:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 08:39:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 08:39:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 08:39:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 08:39:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 08:39:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 08:39:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 08:39:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:39:21,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:21,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498886486] [2024-10-24 08:39:21,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498886486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:21,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:21,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 08:39:21,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486906479] [2024-10-24 08:39:21,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:21,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:39:21,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:21,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:39:21,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:39:21,823 INFO L87 Difference]: Start difference. First operand 180 states and 252 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:21,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:21,978 INFO L93 Difference]: Finished difference Result 503 states and 704 transitions. [2024-10-24 08:39:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 08:39:21,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-24 08:39:21,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:21,981 INFO L225 Difference]: With dead ends: 503 [2024-10-24 08:39:21,981 INFO L226 Difference]: Without dead ends: 324 [2024-10-24 08:39:21,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:39:21,984 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 84 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:21,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 366 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:39:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-24 08:39:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 227. [2024-10-24 08:39:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 169 states have (on average 1.2958579881656804) internal successors, (219), 171 states have internal predecessors, (219), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 08:39:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 319 transitions. [2024-10-24 08:39:22,013 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 319 transitions. Word has length 144 [2024-10-24 08:39:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:22,014 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 319 transitions. [2024-10-24 08:39:22,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 319 transitions. [2024-10-24 08:39:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 08:39:22,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:22,015 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:22,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 08:39:22,016 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:22,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:22,016 INFO L85 PathProgramCache]: Analyzing trace with hash -932675079, now seen corresponding path program 1 times [2024-10-24 08:39:22,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:22,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650073194] [2024-10-24 08:39:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:22,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:39:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:39:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:39:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:39:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:39:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:39:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:39:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:39:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:39:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:39:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:39:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 08:39:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:39:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 08:39:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 08:39:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 08:39:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 08:39:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 08:39:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 08:39:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 08:39:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 08:39:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 08:39:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:39:22,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:39:22,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650073194] [2024-10-24 08:39:22,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650073194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:22,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:22,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:39:22,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419680678] [2024-10-24 08:39:22,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:22,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:39:22,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:39:22,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:39:22,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:39:22,099 INFO L87 Difference]: Start difference. First operand 227 states and 319 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:22,192 INFO L93 Difference]: Finished difference Result 431 states and 598 transitions. [2024-10-24 08:39:22,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:39:22,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-24 08:39:22,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:22,194 INFO L225 Difference]: With dead ends: 431 [2024-10-24 08:39:22,195 INFO L226 Difference]: Without dead ends: 252 [2024-10-24 08:39:22,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:39:22,196 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 42 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:22,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 180 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:39:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-24 08:39:22,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 214. [2024-10-24 08:39:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 158 states have (on average 1.2784810126582278) internal successors, (202), 159 states have internal predecessors, (202), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 08:39:22,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 298 transitions. [2024-10-24 08:39:22,222 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 298 transitions. Word has length 144 [2024-10-24 08:39:22,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:22,222 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 298 transitions. [2024-10-24 08:39:22,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 298 transitions. [2024-10-24 08:39:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-24 08:39:22,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:22,224 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:22,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 08:39:22,224 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:22,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:22,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1952165040, now seen corresponding path program 1 times [2024-10-24 08:39:22,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:39:22,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094140859] [2024-10-24 08:39:22,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:22,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:39:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 08:39:22,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406454056] [2024-10-24 08:39:22,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:22,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:39:22,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:39:22,285 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:39:22,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 08:39:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:39:22,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:39:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:39:22,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:39:22,795 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:39:22,796 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:39:22,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 08:39:23,003 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,SelfDestructingSolverStorable12 [2024-10-24 08:39:23,006 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:23,091 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:39:23,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:39:23 BoogieIcfgContainer [2024-10-24 08:39:23,095 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:39:23,095 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:39:23,095 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:39:23,095 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:39:23,096 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:39:00" (3/4) ... [2024-10-24 08:39:23,097 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:39:23,098 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:39:23,099 INFO L158 Benchmark]: Toolchain (without parser) took 23461.89ms. Allocated memory was 165.7MB in the beginning and 346.0MB in the end (delta: 180.4MB). Free memory was 129.3MB in the beginning and 134.8MB in the end (delta: -5.6MB). Peak memory consumption was 174.8MB. Max. memory is 16.1GB. [2024-10-24 08:39:23,099 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:39:23,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.20ms. Allocated memory is still 165.7MB. Free memory was 129.3MB in the beginning and 113.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 08:39:23,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.38ms. Allocated memory is still 165.7MB. Free memory was 113.5MB in the beginning and 110.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:39:23,100 INFO L158 Benchmark]: Boogie Preprocessor took 62.85ms. Allocated memory is still 165.7MB. Free memory was 110.4MB in the beginning and 105.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 08:39:23,100 INFO L158 Benchmark]: RCFGBuilder took 567.34ms. Allocated memory is still 165.7MB. Free memory was 105.1MB in the beginning and 112.2MB in the end (delta: -7.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 08:39:23,100 INFO L158 Benchmark]: TraceAbstraction took 22478.59ms. Allocated memory was 165.7MB in the beginning and 346.0MB in the end (delta: 180.4MB). Free memory was 112.2MB in the beginning and 135.9MB in the end (delta: -23.6MB). Peak memory consumption was 158.8MB. Max. memory is 16.1GB. [2024-10-24 08:39:23,100 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 346.0MB. Free memory was 135.9MB in the beginning and 134.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:39:23,101 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.20ms. Allocated memory is still 165.7MB. Free memory was 129.3MB in the beginning and 113.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.38ms. Allocated memory is still 165.7MB. Free memory was 113.5MB in the beginning and 110.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.85ms. Allocated memory is still 165.7MB. Free memory was 110.4MB in the beginning and 105.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 567.34ms. Allocated memory is still 165.7MB. Free memory was 105.1MB in the beginning and 112.2MB in the end (delta: -7.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 22478.59ms. Allocated memory was 165.7MB in the beginning and 346.0MB in the end (delta: 180.4MB). Free memory was 112.2MB in the beginning and 135.9MB in the end (delta: -23.6MB). Peak memory consumption was 158.8MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 346.0MB. Free memory was 135.9MB in the beginning and 134.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] unsigned short int last_1_var_1_15 = 128; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L116] last_1_var_1_15 = var_1_15 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L82] var_1_3 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L83] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] var_1_4 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] var_1_5 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L89] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] var_1_7 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L92] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L93] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L93] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L94] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L95] var_1_8 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L96] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L97] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L98] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L100] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L101] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L104] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L105] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L106] var_1_16 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L107] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L108] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L109] var_1_17 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L110] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L111] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L111] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L113] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L127] RET updateVariables() [L128] CALL step() [L45] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L45] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L50] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L52] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L52] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L53] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L54] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L58] signed long int stepLocal_1 = -4; [L59] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L60] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L65] var_1_18 = var_1_17 [L66] var_1_19 = 0 [L67] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L68] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=120, var_1_12=10, var_1_13=16, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L71] COND TRUE var_1_3 <= var_1_1 [L72] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=16, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L76] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=32767, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=16, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L77] COND TRUE (~ var_1_3) < stepLocal_2 [L78] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119-L120] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=120, var_1_12=0, var_1_13=-5, var_1_15=184, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.3s, OverallIterations: 13, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1106 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1106 mSDsluCounter, 4169 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2984 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2608 IncrementalHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 1185 mSDtfsCounter, 2608 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 659 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=11, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 553 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 2001 NumberOfCodeBlocks, 2001 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1699 ConstructedInterpolants, 0 QuantifiedInterpolants, 8648 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 11088/11088 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 08:39:23,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.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 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:39:25,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:39:25,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:39:25,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:39:25,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:39:25,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:39:25,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:39:25,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:39:25,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:39:25,213 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:39:25,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:39:25,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:39:25,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:39:25,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:39:25,214 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:39:25,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:39:25,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:39:25,215 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:39:25,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:39:25,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:39:25,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:39:25,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:39:25,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:39:25,220 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:39:25,221 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:39:25,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:39:25,222 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:39:25,222 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:39:25,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:39:25,222 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:39:25,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:39:25,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:39:25,223 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:39:25,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:39:25,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:39:25,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:39:25,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:39:25,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:39:25,223 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:39:25,223 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:39:25,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:39:25,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:39:25,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:39:25,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:39:25,224 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:39:25,225 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 -> 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf [2024-10-24 08:39:25,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:39:25,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:39:25,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:39:25,496 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:39:25,496 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:39:25,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i [2024-10-24 08:39:26,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:39:27,042 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:39:27,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i [2024-10-24 08:39:27,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dac9eb9a6/4b52075a05fb4fd1b0be80285e83463a/FLAGd7f1b25a7 [2024-10-24 08:39:27,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dac9eb9a6/4b52075a05fb4fd1b0be80285e83463a [2024-10-24 08:39:27,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:39:27,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:39:27,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:39:27,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:39:27,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:39:27,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:39:27" (1/1) ... [2024-10-24 08:39:27,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a0d7b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:27, skipping insertion in model container [2024-10-24 08:39:27,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:39:27" (1/1) ... [2024-10-24 08:39:27,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:39:27,608 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i[913,926] [2024-10-24 08:39:27,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:39:27,696 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:39:27,707 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i[913,926] [2024-10-24 08:39:27,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:39:27,763 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:39:27,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:27 WrapperNode [2024-10-24 08:39:27,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:39:27,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:39:27,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:39:27,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:39:27,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:27" (1/1) ... [2024-10-24 08:39:27,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:27" (1/1) ... [2024-10-24 08:39:27,814 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-10-24 08:39:27,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:39:27,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:39:27,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:39:27,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:39:27,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:27" (1/1) ... [2024-10-24 08:39:27,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:27" (1/1) ... [2024-10-24 08:39:27,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:27" (1/1) ... [2024-10-24 08:39:27,846 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:39:27,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:27" (1/1) ... [2024-10-24 08:39:27,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:27" (1/1) ... [2024-10-24 08:39:27,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:27" (1/1) ... [2024-10-24 08:39:27,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:27" (1/1) ... [2024-10-24 08:39:27,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:27" (1/1) ... [2024-10-24 08:39:27,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:27" (1/1) ... [2024-10-24 08:39:27,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:39:27,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:39:27,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:39:27,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:39:27,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:27" (1/1) ... [2024-10-24 08:39:27,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:39:27,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:39:27,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:39:27,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:39:27,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:39:27,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:39:27,949 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:39:27,949 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:39:27,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:39:27,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:39:28,015 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:39:28,018 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:39:28,406 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 08:39:28,406 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:39:28,472 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:39:28,473 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:39:28,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:39:28 BoogieIcfgContainer [2024-10-24 08:39:28,473 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:39:28,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:39:28,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:39:28,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:39:28,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:39:27" (1/3) ... [2024-10-24 08:39:28,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fdf20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:39:28, skipping insertion in model container [2024-10-24 08:39:28,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:39:27" (2/3) ... [2024-10-24 08:39:28,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fdf20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:39:28, skipping insertion in model container [2024-10-24 08:39:28,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:39:28" (3/3) ... [2024-10-24 08:39:28,482 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-84.i [2024-10-24 08:39:28,498 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:39:28,499 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:39:28,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:39:28,557 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;@7e6416fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:39:28,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:39:28,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 08:39:28,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 08:39:28,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:28,575 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:28,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:28,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:28,580 INFO L85 PathProgramCache]: Analyzing trace with hash -153112892, now seen corresponding path program 1 times [2024-10-24 08:39:28,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:39:28,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347546031] [2024-10-24 08:39:28,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:28,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:39:28,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:39:28,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:39:28,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 08:39:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:28,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:39:28,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:39:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2024-10-24 08:39:28,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:39:28,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:39:28,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347546031] [2024-10-24 08:39:28,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347546031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:28,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:28,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:39:28,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238870182] [2024-10-24 08:39:28,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:28,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:39:28,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:39:28,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:39:28,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:39:28,871 INFO L87 Difference]: Start difference. First operand has 57 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 08:39:28,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:28,944 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2024-10-24 08:39:28,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:39:28,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2024-10-24 08:39:28,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:28,959 INFO L225 Difference]: With dead ends: 111 [2024-10-24 08:39:28,959 INFO L226 Difference]: Without dead ends: 55 [2024-10-24 08:39:28,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:39:28,964 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:28,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:39:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-24 08:39:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-24 08:39:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 08:39:28,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 84 transitions. [2024-10-24 08:39:28,999 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 84 transitions. Word has length 135 [2024-10-24 08:39:28,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:28,999 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 84 transitions. [2024-10-24 08:39:28,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 08:39:28,999 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 84 transitions. [2024-10-24 08:39:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 08:39:29,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:29,002 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:29,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 08:39:29,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:39:29,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:29,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:29,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1571604612, now seen corresponding path program 1 times [2024-10-24 08:39:29,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:39:29,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672973657] [2024-10-24 08:39:29,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:29,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:39:29,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:39:29,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:39:29,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 08:39:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:29,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 08:39:29,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:39:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:39:29,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:39:29,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:39:29,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672973657] [2024-10-24 08:39:29,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672973657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:39:29,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:39:29,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:39:29,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245418651] [2024-10-24 08:39:29,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:39:29,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:39:29,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:39:29,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:39:29,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:39:29,418 INFO L87 Difference]: Start difference. First operand 55 states and 84 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:39:29,503 INFO L93 Difference]: Finished difference Result 109 states and 167 transitions. [2024-10-24 08:39:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:39:29,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 135 [2024-10-24 08:39:29,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:39:29,515 INFO L225 Difference]: With dead ends: 109 [2024-10-24 08:39:29,515 INFO L226 Difference]: Without dead ends: 55 [2024-10-24 08:39:29,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:39:29,518 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:39:29,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 79 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:39:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-24 08:39:29,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-24 08:39:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 08:39:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2024-10-24 08:39:29,529 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 135 [2024-10-24 08:39:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:39:29,531 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2024-10-24 08:39:29,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:39:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2024-10-24 08:39:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 08:39:29,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:39:29,533 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:39:29,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 08:39:29,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:39:29,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:39:29,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:39:29,735 INFO L85 PathProgramCache]: Analyzing trace with hash -948355322, now seen corresponding path program 1 times [2024-10-24 08:39:29,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:39:29,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732539512] [2024-10-24 08:39:29,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:39:29,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:39:29,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:39:29,738 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:39:29,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 08:39:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:39:29,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 08:39:29,937 INFO L278 TraceCheckSpWp]: Computing forward predicates...