./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_operatoramount_amount25_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_operatoramount_amount25_file-87.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 e3da299f1752ee08576ff67ebc19be30d3a209c67fcfa6061ee76b74742c8873 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:48:29,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:48:29,577 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 12:48:29,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:48:29,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:48:29,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:48:29,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:48:29,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:48:29,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:48:29,620 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:48:29,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:48:29,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:48:29,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:48:29,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:48:29,623 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:48:29,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:48:29,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:48:29,624 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:48:29,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 12:48:29,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:48:29,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:48:29,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:48:29,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:48:29,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:48:29,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:48:29,630 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:48:29,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:48:29,630 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:48:29,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:48:29,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:48:29,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:48:29,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:48:29,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:48:29,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:48:29,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:48:29,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:48:29,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 12:48:29,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 12:48:29,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:48:29,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:48:29,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:48:29,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:48:29,634 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 -> e3da299f1752ee08576ff67ebc19be30d3a209c67fcfa6061ee76b74742c8873 [2024-10-14 12:48:29,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:48:29,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:48:29,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:48:29,921 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:48:29,922 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:48:29,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i [2024-10-14 12:48:31,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:48:31,661 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:48:31,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i [2024-10-14 12:48:31,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d7b9de50/c96b09db303b4798a9dadae9bbc2dcd0/FLAG94d24b117 [2024-10-14 12:48:32,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d7b9de50/c96b09db303b4798a9dadae9bbc2dcd0 [2024-10-14 12:48:32,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:48:32,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:48:32,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:48:32,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:48:32,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:48:32,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:48:32" (1/1) ... [2024-10-14 12:48:32,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c384c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:48:32, skipping insertion in model container [2024-10-14 12:48:32,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:48:32" (1/1) ... [2024-10-14 12:48:32,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:48:32,224 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_operatoramount_amount25_file-87.i[915,928] [2024-10-14 12:48:32,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:48:32,289 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:48:32,299 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_operatoramount_amount25_file-87.i[915,928] [2024-10-14 12:48:32,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:48:32,334 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:48:32,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:48:32 WrapperNode [2024-10-14 12:48:32,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:48:32,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:48:32,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:48:32,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:48:32,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:48:32" (1/1) ... [2024-10-14 12:48:32,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:48:32" (1/1) ... [2024-10-14 12:48:32,376 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-10-14 12:48:32,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:48:32,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:48:32,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:48:32,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:48:32,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:48:32" (1/1) ... [2024-10-14 12:48:32,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:48:32" (1/1) ... [2024-10-14 12:48:32,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:48:32" (1/1) ... [2024-10-14 12:48:32,403 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-14 12:48:32,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:48:32" (1/1) ... [2024-10-14 12:48:32,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:48:32" (1/1) ... [2024-10-14 12:48:32,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:48:32" (1/1) ... [2024-10-14 12:48:32,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:48:32" (1/1) ... [2024-10-14 12:48:32,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:48:32" (1/1) ... [2024-10-14 12:48:32,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:48:32" (1/1) ... [2024-10-14 12:48:32,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:48:32,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:48:32,431 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:48:32,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:48:32,432 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:48:32" (1/1) ... [2024-10-14 12:48:32,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:48:32,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:48:32,466 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-14 12:48:32,469 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-14 12:48:32,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:48:32,517 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:48:32,517 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:48:32,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 12:48:32,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:48:32,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:48:32,593 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:48:32,594 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:48:32,856 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 12:48:32,857 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:48:32,898 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:48:32,898 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:48:32,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:48:32 BoogieIcfgContainer [2024-10-14 12:48:32,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:48:32,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:48:32,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:48:32,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:48:32,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:48:32" (1/3) ... [2024-10-14 12:48:32,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2287ef5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:48:32, skipping insertion in model container [2024-10-14 12:48:32,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:48:32" (2/3) ... [2024-10-14 12:48:32,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2287ef5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:48:32, skipping insertion in model container [2024-10-14 12:48:32,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:48:32" (3/3) ... [2024-10-14 12:48:32,912 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-87.i [2024-10-14 12:48:32,929 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:48:32,929 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:48:32,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:48:32,993 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;@1a24dc1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:48:32,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:48:32,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 12:48:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 12:48:33,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:48:33,011 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:48:33,012 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:48:33,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:48:33,018 INFO L85 PathProgramCache]: Analyzing trace with hash 697213815, now seen corresponding path program 1 times [2024-10-14 12:48:33,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:48:33,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117652946] [2024-10-14 12:48:33,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:48:33,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:48:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:33,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:48:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:33,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:48:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:33,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:48:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:33,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:48:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:33,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:48:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:33,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:48:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:33,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:48:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:33,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:48:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:33,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:48:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:33,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:48:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:33,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:48:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:33,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:48:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:33,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 12:48:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:33,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:48:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 12:48:33,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:48:33,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117652946] [2024-10-14 12:48:33,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117652946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:48:33,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:48:33,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:48:33,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244089749] [2024-10-14 12:48:33,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:48:33,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:48:33,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:48:33,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:48:33,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:48:33,409 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 12:48:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:48:33,493 INFO L93 Difference]: Finished difference Result 99 states and 166 transitions. [2024-10-14 12:48:33,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:48:33,496 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2024-10-14 12:48:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:48:33,505 INFO L225 Difference]: With dead ends: 99 [2024-10-14 12:48:33,507 INFO L226 Difference]: Without dead ends: 49 [2024-10-14 12:48:33,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-14 12:48:33,518 INFO L432 NwaCegarLoop]: 69 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, 69 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-14 12:48:33,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:48:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-14 12:48:33,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-14 12:48:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 12:48:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2024-10-14 12:48:33,580 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 92 [2024-10-14 12:48:33,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:48:33,581 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2024-10-14 12:48:33,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 12:48:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2024-10-14 12:48:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 12:48:33,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:48:33,589 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:48:33,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 12:48:33,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:48:33,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:48:33,590 INFO L85 PathProgramCache]: Analyzing trace with hash -146751621, now seen corresponding path program 1 times [2024-10-14 12:48:33,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:48:33,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775829421] [2024-10-14 12:48:33,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:48:33,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:48:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:43,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:48:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:43,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:48:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:43,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:48:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:43,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:48:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:43,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:48:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:43,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:48:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:43,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:48:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:43,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:48:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:43,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:48:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:43,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:48:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:43,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:48:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:43,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:48:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:43,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 12:48:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:43,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:48:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:48:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 12:48:43,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:48:43,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775829421] [2024-10-14 12:48:43,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775829421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:48:43,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:48:43,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 12:48:43,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373032156] [2024-10-14 12:48:43,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:48:43,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 12:48:43,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:48:43,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 12:48:43,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:48:43,120 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 12:48:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:48:43,328 INFO L93 Difference]: Finished difference Result 116 states and 169 transitions. [2024-10-14 12:48:43,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 12:48:43,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-10-14 12:48:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:48:43,332 INFO L225 Difference]: With dead ends: 116 [2024-10-14 12:48:43,332 INFO L226 Difference]: Without dead ends: 68 [2024-10-14 12:48:43,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:48:43,336 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 47 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 12:48:43,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 243 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 12:48:43,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-14 12:48:43,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2024-10-14 12:48:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 12:48:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-10-14 12:48:43,354 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 92 [2024-10-14 12:48:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:48:43,358 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-10-14 12:48:43,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 12:48:43,359 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-10-14 12:48:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 12:48:43,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:48:43,361 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:48:43,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 12:48:43,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:48:43,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:48:43,366 INFO L85 PathProgramCache]: Analyzing trace with hash -383632671, now seen corresponding path program 1 times [2024-10-14 12:48:43,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:48:43,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674436868] [2024-10-14 12:48:43,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:48:43,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:48:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:04,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:49:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:04,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:49:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:04,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:49:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:04,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:49:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:04,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:49:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:04,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:49:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:04,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:49:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:04,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:49:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:04,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:49:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:04,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:49:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:04,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:49:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:04,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:49:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:04,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 12:49:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:04,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:49:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 12:49:04,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:49:04,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674436868] [2024-10-14 12:49:04,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674436868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:49:04,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:49:04,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 12:49:04,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645306956] [2024-10-14 12:49:04,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:49:04,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 12:49:04,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:49:04,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 12:49:04,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 12:49:04,338 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 12:49:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:49:05,195 INFO L93 Difference]: Finished difference Result 193 states and 277 transitions. [2024-10-14 12:49:05,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 12:49:05,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-14 12:49:05,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:49:05,203 INFO L225 Difference]: With dead ends: 193 [2024-10-14 12:49:05,203 INFO L226 Difference]: Without dead ends: 135 [2024-10-14 12:49:05,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-14 12:49:05,207 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 118 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 12:49:05,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 305 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 12:49:05,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-14 12:49:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 64. [2024-10-14 12:49:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 12:49:05,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-10-14 12:49:05,223 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 93 [2024-10-14 12:49:05,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:49:05,224 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-10-14 12:49:05,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 12:49:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-10-14 12:49:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 12:49:05,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:49:05,231 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:49:05,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 12:49:05,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:49:05,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:49:05,232 INFO L85 PathProgramCache]: Analyzing trace with hash 317431907, now seen corresponding path program 1 times [2024-10-14 12:49:05,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:49:05,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015779064] [2024-10-14 12:49:05,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:49:05,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:49:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:05,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:49:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:05,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:49:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:05,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:49:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:05,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:49:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:05,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:49:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:05,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:49:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:05,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:49:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:05,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:49:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:05,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:49:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:05,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:49:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:05,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:49:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:05,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:49:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:05,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 12:49:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:05,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:49:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 12:49:05,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:49:05,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015779064] [2024-10-14 12:49:05,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015779064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:49:05,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:49:05,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 12:49:05,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441364952] [2024-10-14 12:49:05,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:49:05,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 12:49:05,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:49:05,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 12:49:05,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:49:05,566 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 12:49:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:49:05,808 INFO L93 Difference]: Finished difference Result 187 states and 269 transitions. [2024-10-14 12:49:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 12:49:05,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-14 12:49:05,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:49:05,813 INFO L225 Difference]: With dead ends: 187 [2024-10-14 12:49:05,814 INFO L226 Difference]: Without dead ends: 124 [2024-10-14 12:49:05,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 12:49:05,820 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 64 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 12:49:05,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 316 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 12:49:05,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-14 12:49:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2024-10-14 12:49:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 88 states have internal predecessors, (123), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:49:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-10-14 12:49:05,847 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 93 [2024-10-14 12:49:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:49:05,848 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-10-14 12:49:05,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 12:49:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-10-14 12:49:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 12:49:05,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:49:05,856 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:49:05,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 12:49:05,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:49:05,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:49:05,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1394749921, now seen corresponding path program 1 times [2024-10-14 12:49:05,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:49:05,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458213426] [2024-10-14 12:49:05,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:49:05,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:49:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:49:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:49:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:49:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:49:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:49:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:49:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:49:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:49:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:49:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:49:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:49:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:49:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 12:49:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:49:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 12:49:15,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:49:15,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458213426] [2024-10-14 12:49:15,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458213426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:49:15,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:49:15,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 12:49:15,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845164098] [2024-10-14 12:49:15,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:49:15,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 12:49:15,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:49:15,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 12:49:15,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 12:49:15,117 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 12:49:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:49:15,500 INFO L93 Difference]: Finished difference Result 304 states and 439 transitions. [2024-10-14 12:49:15,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 12:49:15,502 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-14 12:49:15,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:49:15,505 INFO L225 Difference]: With dead ends: 304 [2024-10-14 12:49:15,505 INFO L226 Difference]: Without dead ends: 199 [2024-10-14 12:49:15,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 12:49:15,507 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 94 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 12:49:15,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 301 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 12:49:15,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-14 12:49:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 169. [2024-10-14 12:49:15,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 132 states have (on average 1.393939393939394) internal successors, (184), 134 states have internal predecessors, (184), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 12:49:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 248 transitions. [2024-10-14 12:49:15,537 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 248 transitions. Word has length 93 [2024-10-14 12:49:15,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:49:15,537 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 248 transitions. [2024-10-14 12:49:15,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 12:49:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 248 transitions. [2024-10-14 12:49:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 12:49:15,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:49:15,539 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:49:15,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 12:49:15,539 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:49:15,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:49:15,540 INFO L85 PathProgramCache]: Analyzing trace with hash -693685343, now seen corresponding path program 1 times [2024-10-14 12:49:15,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:49:15,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905848900] [2024-10-14 12:49:15,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:49:15,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:49:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:49:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:49:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:49:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:49:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:49:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:49:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:49:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:49:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:49:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:49:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:49:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:49:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 12:49:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:49:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 12:49:15,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:49:15,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905848900] [2024-10-14 12:49:15,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905848900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:49:15,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:49:15,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 12:49:15,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223906999] [2024-10-14 12:49:15,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:49:15,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 12:49:15,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:49:15,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 12:49:15,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:49:15,720 INFO L87 Difference]: Start difference. First operand 169 states and 248 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 12:49:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:49:15,829 INFO L93 Difference]: Finished difference Result 322 states and 472 transitions. [2024-10-14 12:49:15,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 12:49:15,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-14 12:49:15,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:49:15,832 INFO L225 Difference]: With dead ends: 322 [2024-10-14 12:49:15,832 INFO L226 Difference]: Without dead ends: 161 [2024-10-14 12:49:15,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:49:15,835 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 45 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:49:15,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 298 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:49:15,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-14 12:49:15,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2024-10-14 12:49:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 124 states have internal predecessors, (167), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 12:49:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 231 transitions. [2024-10-14 12:49:15,876 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 231 transitions. Word has length 93 [2024-10-14 12:49:15,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:49:15,877 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 231 transitions. [2024-10-14 12:49:15,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 12:49:15,877 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 231 transitions. [2024-10-14 12:49:15,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 12:49:15,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:49:15,879 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:49:15,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 12:49:15,879 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:49:15,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:49:15,880 INFO L85 PathProgramCache]: Analyzing trace with hash 354462304, now seen corresponding path program 1 times [2024-10-14 12:49:15,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:49:15,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26234754] [2024-10-14 12:49:15,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:49:15,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:49:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:22,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:49:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:22,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:49:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:22,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:49:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:22,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:49:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:22,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:49:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:22,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:49:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:22,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:49:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:22,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:49:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:22,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:49:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:22,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:49:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:22,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:49:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:22,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:49:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:22,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 12:49:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:22,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:49:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 12:49:22,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:49:22,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26234754] [2024-10-14 12:49:22,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26234754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:49:22,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:49:22,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 12:49:22,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174975762] [2024-10-14 12:49:22,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:49:22,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 12:49:22,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:49:22,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 12:49:22,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 12:49:22,257 INFO L87 Difference]: Start difference. First operand 159 states and 231 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 12:49:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:49:23,774 INFO L93 Difference]: Finished difference Result 243 states and 342 transitions. [2024-10-14 12:49:23,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 12:49:23,775 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-10-14 12:49:23,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:49:23,776 INFO L225 Difference]: With dead ends: 243 [2024-10-14 12:49:23,776 INFO L226 Difference]: Without dead ends: 241 [2024-10-14 12:49:23,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-14 12:49:23,777 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 27 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 12:49:23,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 317 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 12:49:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-14 12:49:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 233. [2024-10-14 12:49:23,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 183 states have (on average 1.3278688524590163) internal successors, (243), 188 states have internal predecessors, (243), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 12:49:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 327 transitions. [2024-10-14 12:49:23,825 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 327 transitions. Word has length 94 [2024-10-14 12:49:23,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:49:23,826 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 327 transitions. [2024-10-14 12:49:23,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 12:49:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 327 transitions. [2024-10-14 12:49:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 12:49:23,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:49:23,828 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:49:23,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 12:49:23,828 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:49:23,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:49:23,829 INFO L85 PathProgramCache]: Analyzing trace with hash 91929880, now seen corresponding path program 1 times [2024-10-14 12:49:23,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:49:23,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37792900] [2024-10-14 12:49:23,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:49:23,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:49:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:39,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:49:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:39,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:49:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:39,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:49:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:39,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:49:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:39,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:49:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:39,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:49:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:39,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:49:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:39,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:49:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:39,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:49:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:39,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:49:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:39,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:49:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:39,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:49:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:39,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 12:49:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:39,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:49:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 12:49:39,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:49:39,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37792900] [2024-10-14 12:49:39,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37792900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:49:39,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:49:39,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 12:49:39,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024817060] [2024-10-14 12:49:39,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:49:39,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 12:49:39,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:49:39,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 12:49:39,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:49:39,769 INFO L87 Difference]: Start difference. First operand 233 states and 327 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 12:49:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:49:40,667 INFO L93 Difference]: Finished difference Result 419 states and 584 transitions. [2024-10-14 12:49:40,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 12:49:40,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-10-14 12:49:40,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:49:40,670 INFO L225 Difference]: With dead ends: 419 [2024-10-14 12:49:40,670 INFO L226 Difference]: Without dead ends: 264 [2024-10-14 12:49:40,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-14 12:49:40,672 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 48 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 12:49:40,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 310 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 12:49:40,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-14 12:49:40,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 223. [2024-10-14 12:49:40,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 173 states have (on average 1.3121387283236994) internal successors, (227), 178 states have internal predecessors, (227), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 12:49:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 311 transitions. [2024-10-14 12:49:40,719 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 311 transitions. Word has length 94 [2024-10-14 12:49:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:49:40,719 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 311 transitions. [2024-10-14 12:49:40,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 12:49:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 311 transitions. [2024-10-14 12:49:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 12:49:40,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:49:40,721 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:49:40,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 12:49:40,721 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:49:40,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:49:40,722 INFO L85 PathProgramCache]: Analyzing trace with hash 350095318, now seen corresponding path program 1 times [2024-10-14 12:49:40,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:49:40,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707981617] [2024-10-14 12:49:40,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:49:40,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:49:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:49,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:49:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:49,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:49:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:49,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:49:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:49,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:49:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:49,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:49:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:49,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:49:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:49,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:49:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:49,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:49:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:49,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:49:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:49,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:49:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:49,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:49:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:49,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:49:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:49,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 12:49:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:49,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:49:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 12:49:49,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:49:49,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707981617] [2024-10-14 12:49:49,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707981617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:49:49,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:49:49,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 12:49:49,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429058435] [2024-10-14 12:49:49,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:49:49,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 12:49:49,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:49:49,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 12:49:49,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:49:49,144 INFO L87 Difference]: Start difference. First operand 223 states and 311 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 12:49:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:49:49,842 INFO L93 Difference]: Finished difference Result 378 states and 523 transitions. [2024-10-14 12:49:49,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 12:49:49,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-10-14 12:49:49,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:49:49,845 INFO L225 Difference]: With dead ends: 378 [2024-10-14 12:49:49,846 INFO L226 Difference]: Without dead ends: 233 [2024-10-14 12:49:49,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-14 12:49:49,848 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 45 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 12:49:49,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 323 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 12:49:49,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-14 12:49:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 223. [2024-10-14 12:49:49,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 173 states have (on average 1.30635838150289) internal successors, (226), 178 states have internal predecessors, (226), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 12:49:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 310 transitions. [2024-10-14 12:49:49,886 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 310 transitions. Word has length 94 [2024-10-14 12:49:49,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:49:49,887 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 310 transitions. [2024-10-14 12:49:49,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 12:49:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 310 transitions. [2024-10-14 12:49:49,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 12:49:49,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:49:49,889 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:49:49,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 12:49:49,889 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:49:49,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:49:49,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1608059649, now seen corresponding path program 1 times [2024-10-14 12:49:49,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:49:49,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622164203] [2024-10-14 12:49:49,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:49:49,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:49:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 12:49:49,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1230403098] [2024-10-14 12:49:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:49:49,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:49:49,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:49:49,931 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-14 12:49:49,933 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-14 12:49:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:49:50,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 12:49:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:49:50,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 12:49:50,184 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 12:49:50,185 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 12:49:50,201 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-14 12:49:50,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 12:49:50,393 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:49:50,459 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 12:49:50,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:49:50 BoogieIcfgContainer [2024-10-14 12:49:50,463 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 12:49:50,463 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 12:49:50,463 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 12:49:50,464 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 12:49:50,464 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:48:32" (3/4) ... [2024-10-14 12:49:50,466 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 12:49:50,467 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 12:49:50,468 INFO L158 Benchmark]: Toolchain (without parser) took 78422.54ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 971.0MB). Free memory was 114.0MB in the beginning and 854.7MB in the end (delta: -740.7MB). Peak memory consumption was 232.6MB. Max. memory is 16.1GB. [2024-10-14 12:49:50,468 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 169.9MB. Free memory was 133.4MB in the beginning and 133.2MB in the end (delta: 185.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:49:50,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.42ms. Allocated memory is still 169.9MB. Free memory was 114.0MB in the beginning and 101.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 12:49:50,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.84ms. Allocated memory is still 169.9MB. Free memory was 100.8MB in the beginning and 99.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 12:49:50,469 INFO L158 Benchmark]: Boogie Preprocessor took 52.99ms. Allocated memory is still 169.9MB. Free memory was 99.3MB in the beginning and 96.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 12:49:50,469 INFO L158 Benchmark]: RCFGBuilder took 467.79ms. Allocated memory is still 169.9MB. Free memory was 96.5MB in the beginning and 77.7MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 12:49:50,470 INFO L158 Benchmark]: TraceAbstraction took 77560.00ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 971.0MB). Free memory was 76.9MB in the beginning and 854.7MB in the end (delta: -777.8MB). Peak memory consumption was 194.9MB. Max. memory is 16.1GB. [2024-10-14 12:49:50,470 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 1.1GB. Free memory is still 854.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:49:50,472 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.16ms. Allocated memory is still 169.9MB. Free memory was 133.4MB in the beginning and 133.2MB in the end (delta: 185.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.42ms. Allocated memory is still 169.9MB. Free memory was 114.0MB in the beginning and 101.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.84ms. Allocated memory is still 169.9MB. Free memory was 100.8MB in the beginning and 99.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.99ms. Allocated memory is still 169.9MB. Free memory was 99.3MB in the beginning and 96.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 467.79ms. Allocated memory is still 169.9MB. Free memory was 96.5MB in the beginning and 77.7MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 77560.00ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 971.0MB). Free memory was 76.9MB in the beginning and 854.7MB in the end (delta: -777.8MB). Peak memory consumption was 194.9MB. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 1.1GB. Free memory is still 854.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned long int var_1_3 = 3164414017; [L25] unsigned long int var_1_4 = 128; [L26] signed char var_1_5 = -128; [L27] signed char var_1_6 = 10; [L28] signed char var_1_7 = 50; [L29] float var_1_8 = 5.1; [L30] float var_1_9 = 63.75; [L31] signed char var_1_10 = 100; [L32] signed long int var_1_12 = 5; [L33] signed char last_1_var_1_10 = 100; [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L90] last_1_var_1_10 = var_1_10 [L100] RET updateLastVariables() [L101] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L70] var_1_3 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L71] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L72] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L72] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L73] var_1_4 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L75] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L75] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L76] var_1_6 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_6 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L77] RET assume_abort_if_not(var_1_6 >= -126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L78] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L78] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L79] var_1_7 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L80] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L81] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L81] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L82] var_1_9 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L83] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L84] var_1_12 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L85] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L86] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L86] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L87] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L87] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L101] RET updateVariables() [L102] CALL step() [L37] COND TRUE \read(var_1_2) [L38] var_1_1 = ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L40] signed long int stepLocal_1 = -8; [L41] unsigned long int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, stepLocal_1=-8, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L42] COND FALSE !(stepLocal_1 < var_1_4) [L49] var_1_5 = -2 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L51] unsigned long int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, stepLocal_3=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L52] EXPR var_1_4 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, stepLocal_3=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L52] unsigned long int stepLocal_2 = var_1_4 >> var_1_3; [L53] COND TRUE var_1_6 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, stepLocal_3=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L54] COND TRUE var_1_6 != stepLocal_3 [L55] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L58] COND FALSE !((var_1_1 + (var_1_6 / var_1_12)) < var_1_1) VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L93] EXPR var_1_4 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L93] EXPR ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L93-L94] return (((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1)) && (((var_1_1 + (var_1_6 / var_1_12)) < var_1_1) ? ((var_1_7 >= last_1_var_1_10) ? (var_1_10 == ((signed char) -32)) : (var_1_10 == ((signed char) var_1_7))) : 1) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 77.4s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 488 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 488 mSDsluCounter, 2482 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1846 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1532 IncrementalHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 636 mSDtfsCounter, 1532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 299 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=7, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 189 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 70.8s InterpolantComputationTime, 1028 NumberOfCodeBlocks, 1028 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 14108 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 3276/3276 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-14 12:49:50,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.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 e3da299f1752ee08576ff67ebc19be30d3a209c67fcfa6061ee76b74742c8873 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:49:52,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:49:52,845 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 12:49:52,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:49:52,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:49:52,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:49:52,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:49:52,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:49:52,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:49:52,884 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:49:52,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:49:52,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:49:52,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:49:52,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:49:52,888 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:49:52,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:49:52,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:49:52,888 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:49:52,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:49:52,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:49:52,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:49:52,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:49:52,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:49:52,894 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 12:49:52,894 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 12:49:52,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:49:52,894 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 12:49:52,895 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:49:52,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:49:52,895 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:49:52,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:49:52,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:49:52,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:49:52,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:49:52,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:49:52,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:49:52,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:49:52,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:49:52,898 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 12:49:52,898 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 12:49:52,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:49:52,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:49:52,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:49:52,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:49:52,899 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 12:49:52,899 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 -> e3da299f1752ee08576ff67ebc19be30d3a209c67fcfa6061ee76b74742c8873 [2024-10-14 12:49:53,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:49:53,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:49:53,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:49:53,264 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:49:53,264 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:49:53,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i [2024-10-14 12:49:54,894 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:49:55,108 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:49:55,109 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i [2024-10-14 12:49:55,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e78836ec6/85f03788d6284a11be379b181329107b/FLAG31319e574 [2024-10-14 12:49:55,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e78836ec6/85f03788d6284a11be379b181329107b [2024-10-14 12:49:55,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:49:55,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:49:55,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:49:55,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:49:55,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:49:55,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:49:55" (1/1) ... [2024-10-14 12:49:55,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1defc7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:49:55, skipping insertion in model container [2024-10-14 12:49:55,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:49:55" (1/1) ... [2024-10-14 12:49:55,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:49:55,353 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_operatoramount_amount25_file-87.i[915,928] [2024-10-14 12:49:55,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:49:55,460 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:49:55,479 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_operatoramount_amount25_file-87.i[915,928] [2024-10-14 12:49:55,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:49:55,530 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:49:55,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:49:55 WrapperNode [2024-10-14 12:49:55,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:49:55,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:49:55,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:49:55,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:49:55,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:49:55" (1/1) ... [2024-10-14 12:49:55,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:49:55" (1/1) ... [2024-10-14 12:49:55,585 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-10-14 12:49:55,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:49:55,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:49:55,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:49:55,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:49:55,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:49:55" (1/1) ... [2024-10-14 12:49:55,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:49:55" (1/1) ... [2024-10-14 12:49:55,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:49:55" (1/1) ... [2024-10-14 12:49:55,621 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-14 12:49:55,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:49:55" (1/1) ... [2024-10-14 12:49:55,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:49:55" (1/1) ... [2024-10-14 12:49:55,633 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:49:55" (1/1) ... [2024-10-14 12:49:55,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:49:55" (1/1) ... [2024-10-14 12:49:55,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:49:55" (1/1) ... [2024-10-14 12:49:55,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:49:55" (1/1) ... [2024-10-14 12:49:55,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:49:55,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:49:55,657 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:49:55,657 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:49:55,658 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:49:55" (1/1) ... [2024-10-14 12:49:55,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:49:55,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:49:55,691 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-14 12:49:55,698 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-14 12:49:55,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:49:55,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 12:49:55,743 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:49:55,743 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:49:55,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:49:55,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:49:55,821 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:49:55,824 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:49:56,192 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-14 12:49:56,193 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:49:56,257 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:49:56,260 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:49:56,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:49:56 BoogieIcfgContainer [2024-10-14 12:49:56,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:49:56,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:49:56,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:49:56,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:49:56,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:49:55" (1/3) ... [2024-10-14 12:49:56,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1721b026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:49:56, skipping insertion in model container [2024-10-14 12:49:56,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:49:55" (2/3) ... [2024-10-14 12:49:56,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1721b026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:49:56, skipping insertion in model container [2024-10-14 12:49:56,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:49:56" (3/3) ... [2024-10-14 12:49:56,271 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-87.i [2024-10-14 12:49:56,288 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:49:56,288 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:49:56,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:49:56,361 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;@1cb0d507, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:49:56,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:49:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 12:49:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 12:49:56,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:49:56,377 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:49:56,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:49:56,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:49:56,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1783494206, now seen corresponding path program 1 times [2024-10-14 12:49:56,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:49:56,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450175497] [2024-10-14 12:49:56,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:49:56,403 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-14 12:49:56,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:49:56,406 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-14 12:49:56,407 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-14 12:49:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:49:56,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 12:49:56,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:49:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-14 12:49:56,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:49:56,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:49:56,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450175497] [2024-10-14 12:49:56,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450175497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:49:56,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:49:56,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:49:56,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812271171] [2024-10-14 12:49:56,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:49:56,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:49:56,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:49:56,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:49:56,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:49:56,721 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)