./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_floatingpointinfluence_has-floats_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_floatingpointinfluence_has-floats_file-33.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 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:25:21,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:25:21,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:25:22,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:25:22,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:25:22,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:25:22,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:25:22,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:25:22,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:25:22,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:25:22,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:25:22,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:25:22,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:25:22,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:25:22,033 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:25:22,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:25:22,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:25:22,038 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:25:22,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:25:22,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:25:22,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:25:22,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:25:22,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:25:22,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:25:22,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:25:22,041 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:25:22,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:25:22,041 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:25:22,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:25:22,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:25:22,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:25:22,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:25:22,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:25:22,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:25:22,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:25:22,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:25:22,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:25:22,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:25:22,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:25:22,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:25:22,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:25:22,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:25:22,045 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 -> 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 [2024-10-13 03:25:22,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:25:22,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:25:22,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:25:22,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:25:22,339 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:25:22,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2024-10-13 03:25:23,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:25:24,150 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:25:24,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2024-10-13 03:25:24,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685b86352/6ba58473b35542fe8423e2f01967404a/FLAG6848a3e38 [2024-10-13 03:25:24,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685b86352/6ba58473b35542fe8423e2f01967404a [2024-10-13 03:25:24,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:25:24,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:25:24,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:25:24,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:25:24,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:25:24,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:25:24" (1/1) ... [2024-10-13 03:25:24,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf6a686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:24, skipping insertion in model container [2024-10-13 03:25:24,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:25:24" (1/1) ... [2024-10-13 03:25:24,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:25:24,740 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_floatingpointinfluence_has-floats_file-33.i[917,930] [2024-10-13 03:25:24,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:25:24,804 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:25:24,814 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_floatingpointinfluence_has-floats_file-33.i[917,930] [2024-10-13 03:25:24,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:25:24,848 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:25:24,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:24 WrapperNode [2024-10-13 03:25:24,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:25:24,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:25:24,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:25:24,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:25:24,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:24" (1/1) ... [2024-10-13 03:25:24,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:24" (1/1) ... [2024-10-13 03:25:24,910 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2024-10-13 03:25:24,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:25:24,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:25:24,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:25:24,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:25:24,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:24" (1/1) ... [2024-10-13 03:25:24,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:24" (1/1) ... [2024-10-13 03:25:24,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:24" (1/1) ... [2024-10-13 03:25:24,957 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-13 03:25:24,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:24" (1/1) ... [2024-10-13 03:25:24,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:24" (1/1) ... [2024-10-13 03:25:24,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:24" (1/1) ... [2024-10-13 03:25:24,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:24" (1/1) ... [2024-10-13 03:25:24,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:24" (1/1) ... [2024-10-13 03:25:24,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:24" (1/1) ... [2024-10-13 03:25:24,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:25:24,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:25:24,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:25:24,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:25:24,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:24" (1/1) ... [2024-10-13 03:25:24,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:25:25,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:25:25,030 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-13 03:25:25,034 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-13 03:25:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:25:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:25:25,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:25:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:25:25,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:25:25,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:25:25,189 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:25:25,191 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:25:25,596 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-13 03:25:25,597 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:25:25,633 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:25:25,633 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:25:25,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:25:25 BoogieIcfgContainer [2024-10-13 03:25:25,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:25:25,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:25:25,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:25:25,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:25:25,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:25:24" (1/3) ... [2024-10-13 03:25:25,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aff4155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:25:25, skipping insertion in model container [2024-10-13 03:25:25,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:24" (2/3) ... [2024-10-13 03:25:25,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aff4155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:25:25, skipping insertion in model container [2024-10-13 03:25:25,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:25:25" (3/3) ... [2024-10-13 03:25:25,647 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-33.i [2024-10-13 03:25:25,664 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:25:25,664 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:25:25,718 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:25:25,725 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;@2e88186a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:25:25,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:25:25,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 03:25:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 03:25:25,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:25,743 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:25,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:25,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:25,751 INFO L85 PathProgramCache]: Analyzing trace with hash 123147903, now seen corresponding path program 1 times [2024-10-13 03:25:25,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:25:25,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293184237] [2024-10-13 03:25:25,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:25,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:25:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:25,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:25:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:25:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:25:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:25:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:25:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:25:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:25:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:25:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:25:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,075 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 03:25:26,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:25:26,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293184237] [2024-10-13 03:25:26,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293184237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:25:26,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:25:26,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:25:26,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316064043] [2024-10-13 03:25:26,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:25:26,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:25:26,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:25:26,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:25:26,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:25:26,110 INFO L87 Difference]: Start difference. First operand has 60 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 03:25:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:25:26,167 INFO L93 Difference]: Finished difference Result 117 states and 189 transitions. [2024-10-13 03:25:26,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:25:26,170 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 70 [2024-10-13 03:25:26,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:25:26,179 INFO L225 Difference]: With dead ends: 117 [2024-10-13 03:25:26,179 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 03:25:26,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-13 03:25:26,191 INFO L432 NwaCegarLoop]: 83 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, 83 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-13 03:25:26,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:25:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 03:25:26,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-13 03:25:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 03:25:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2024-10-13 03:25:26,251 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 70 [2024-10-13 03:25:26,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:25:26,251 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2024-10-13 03:25:26,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 03:25:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2024-10-13 03:25:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 03:25:26,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:26,255 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:26,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:25:26,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:26,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:26,257 INFO L85 PathProgramCache]: Analyzing trace with hash -60785799, now seen corresponding path program 1 times [2024-10-13 03:25:26,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:25:26,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280276947] [2024-10-13 03:25:26,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:26,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:25:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:25:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:25:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:25:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:25:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:25:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:25:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:25:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:25:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:25:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 03:25:26,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:25:26,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280276947] [2024-10-13 03:25:26,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280276947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:25:26,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:25:26,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:25:26,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380815754] [2024-10-13 03:25:26,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:25:26,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:25:26,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:25:26,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:25:26,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:25:26,565 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:25:26,604 INFO L93 Difference]: Finished difference Result 116 states and 173 transitions. [2024-10-13 03:25:26,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:25:26,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2024-10-13 03:25:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:25:26,610 INFO L225 Difference]: With dead ends: 116 [2024-10-13 03:25:26,610 INFO L226 Difference]: Without dead ends: 59 [2024-10-13 03:25:26,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:25:26,612 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:25:26,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:25:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-13 03:25:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-13 03:25:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 03:25:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-10-13 03:25:26,624 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 70 [2024-10-13 03:25:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:25:26,626 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-10-13 03:25:26,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:26,626 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-10-13 03:25:26,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 03:25:26,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:26,628 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:26,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:25:26,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:26,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:26,630 INFO L85 PathProgramCache]: Analyzing trace with hash -870132425, now seen corresponding path program 1 times [2024-10-13 03:25:26,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:25:26,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444765914] [2024-10-13 03:25:26,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:26,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:25:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:25:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:25:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:25:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:25:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:25:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:25:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:25:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:25:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:25:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 03:25:26,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:25:26,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444765914] [2024-10-13 03:25:26,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444765914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:25:26,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:25:26,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:25:26,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320843331] [2024-10-13 03:25:26,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:25:26,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:25:26,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:25:26,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:25:26,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:25:26,931 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:27,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:25:27,195 INFO L93 Difference]: Finished difference Result 141 states and 207 transitions. [2024-10-13 03:25:27,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:25:27,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2024-10-13 03:25:27,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:25:27,198 INFO L225 Difference]: With dead ends: 141 [2024-10-13 03:25:27,198 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 03:25:27,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:25:27,200 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 83 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:25:27,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 248 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:25:27,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 03:25:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2024-10-13 03:25:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 03:25:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2024-10-13 03:25:27,209 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 70 [2024-10-13 03:25:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:25:27,210 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2024-10-13 03:25:27,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2024-10-13 03:25:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 03:25:27,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:27,212 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:27,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:25:27,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:27,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:27,213 INFO L85 PathProgramCache]: Analyzing trace with hash -169067847, now seen corresponding path program 1 times [2024-10-13 03:25:27,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:25:27,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480158048] [2024-10-13 03:25:27,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:27,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:25:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:29,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:25:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:29,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:25:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:29,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:25:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:29,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:25:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:29,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:25:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:29,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:25:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:29,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:25:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:29,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:25:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:29,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:25:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 03:25:29,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:25:29,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480158048] [2024-10-13 03:25:29,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480158048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:25:29,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:25:29,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:25:29,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857661153] [2024-10-13 03:25:29,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:25:29,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:25:29,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:25:29,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:25:29,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:25:29,374 INFO L87 Difference]: Start difference. First operand 61 states and 89 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:30,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:25:30,205 INFO L93 Difference]: Finished difference Result 243 states and 354 transitions. [2024-10-13 03:25:30,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:25:30,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2024-10-13 03:25:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:25:30,210 INFO L225 Difference]: With dead ends: 243 [2024-10-13 03:25:30,210 INFO L226 Difference]: Without dead ends: 183 [2024-10-13 03:25:30,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-13 03:25:30,212 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 226 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:25:30,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 350 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 03:25:30,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-13 03:25:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 79. [2024-10-13 03:25:30,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 03:25:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2024-10-13 03:25:30,230 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 70 [2024-10-13 03:25:30,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:25:30,233 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2024-10-13 03:25:30,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:30,233 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2024-10-13 03:25:30,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 03:25:30,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:30,235 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:30,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:25:30,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:30,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:30,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1757415749, now seen corresponding path program 1 times [2024-10-13 03:25:30,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:25:30,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262865331] [2024-10-13 03:25:30,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:30,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:25:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:25:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:25:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:25:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:25:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:25:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:25:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:25:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:25:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:25:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 03:25:30,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:25:30,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262865331] [2024-10-13 03:25:30,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262865331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:25:30,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:25:30,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 03:25:30,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756822725] [2024-10-13 03:25:30,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:25:30,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 03:25:30,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:25:30,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 03:25:30,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:25:30,642 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:25:30,890 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2024-10-13 03:25:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 03:25:30,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2024-10-13 03:25:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:25:30,893 INFO L225 Difference]: With dead ends: 226 [2024-10-13 03:25:30,893 INFO L226 Difference]: Without dead ends: 148 [2024-10-13 03:25:30,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:25:30,895 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 208 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:25:30,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 325 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:25:30,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-13 03:25:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 87. [2024-10-13 03:25:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 76 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 03:25:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 128 transitions. [2024-10-13 03:25:30,903 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 128 transitions. Word has length 70 [2024-10-13 03:25:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:25:30,904 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 128 transitions. [2024-10-13 03:25:30,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:30,904 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 128 transitions. [2024-10-13 03:25:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 03:25:30,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:30,906 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:30,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:25:30,906 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:30,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:30,906 INFO L85 PathProgramCache]: Analyzing trace with hash 513339644, now seen corresponding path program 1 times [2024-10-13 03:25:30,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:25:30,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42303460] [2024-10-13 03:25:30,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:30,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:25:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:25:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:25:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:25:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:25:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:25:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:25:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:25:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:25:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:25:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 03:25:30,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:25:30,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42303460] [2024-10-13 03:25:30,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42303460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:25:30,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:25:30,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:25:30,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923967724] [2024-10-13 03:25:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:25:30,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:25:30,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:25:30,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:25:30,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:25:30,965 INFO L87 Difference]: Start difference. First operand 87 states and 128 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:25:31,014 INFO L93 Difference]: Finished difference Result 226 states and 333 transitions. [2024-10-13 03:25:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:25:31,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2024-10-13 03:25:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:25:31,016 INFO L225 Difference]: With dead ends: 226 [2024-10-13 03:25:31,016 INFO L226 Difference]: Without dead ends: 140 [2024-10-13 03:25:31,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:25:31,018 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 52 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:25:31,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 172 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:25:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-13 03:25:31,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2024-10-13 03:25:31,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 96 states have internal predecessors, (137), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 03:25:31,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2024-10-13 03:25:31,027 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 71 [2024-10-13 03:25:31,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:25:31,027 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2024-10-13 03:25:31,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2024-10-13 03:25:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 03:25:31,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:31,029 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:31,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:25:31,030 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:31,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:31,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2104015663, now seen corresponding path program 1 times [2024-10-13 03:25:31,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:25:31,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268306327] [2024-10-13 03:25:31,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:31,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:25:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:31,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:25:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:31,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:25:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:31,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:25:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:31,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:25:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:31,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:25:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:31,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:25:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:31,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:25:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:31,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:25:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:25:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 03:25:31,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:25:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268306327] [2024-10-13 03:25:31,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268306327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:25:31,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:25:31,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:25:31,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082439866] [2024-10-13 03:25:31,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:25:31,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:25:31,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:25:31,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:25:31,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:25:31,088 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:25:31,128 INFO L93 Difference]: Finished difference Result 246 states and 355 transitions. [2024-10-13 03:25:31,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:25:31,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2024-10-13 03:25:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:25:31,131 INFO L225 Difference]: With dead ends: 246 [2024-10-13 03:25:31,131 INFO L226 Difference]: Without dead ends: 140 [2024-10-13 03:25:31,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:25:31,133 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 71 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:25:31,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 142 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:25:31,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-13 03:25:31,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 90. [2024-10-13 03:25:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 03:25:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2024-10-13 03:25:31,143 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 71 [2024-10-13 03:25:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:25:31,144 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2024-10-13 03:25:31,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-10-13 03:25:31,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 03:25:31,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:31,146 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:31,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 03:25:31,146 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:31,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:31,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1531250867, now seen corresponding path program 1 times [2024-10-13 03:25:31,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:25:31,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282788557] [2024-10-13 03:25:31,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:31,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:25:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:31,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:25:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:31,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:25:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:31,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:25:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:31,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:25:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:32,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:25:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:32,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:25:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:32,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:25:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:32,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:25:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:32,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:25:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 03:25:32,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:25:32,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282788557] [2024-10-13 03:25:32,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282788557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:25:32,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:25:32,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:25:32,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347342395] [2024-10-13 03:25:32,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:25:32,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:25:32,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:25:32,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:25:32,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:25:32,026 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:32,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:25:32,778 INFO L93 Difference]: Finished difference Result 334 states and 472 transitions. [2024-10-13 03:25:32,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:25:32,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2024-10-13 03:25:32,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:25:32,780 INFO L225 Difference]: With dead ends: 334 [2024-10-13 03:25:32,780 INFO L226 Difference]: Without dead ends: 245 [2024-10-13 03:25:32,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-10-13 03:25:32,781 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 249 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:25:32,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 410 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 03:25:32,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-13 03:25:32,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 74. [2024-10-13 03:25:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 03:25:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2024-10-13 03:25:32,795 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 71 [2024-10-13 03:25:32,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:25:32,796 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2024-10-13 03:25:32,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2024-10-13 03:25:32,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 03:25:32,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:32,797 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:32,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 03:25:32,797 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:32,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:32,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2035515578, now seen corresponding path program 1 times [2024-10-13 03:25:32,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:25:32,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534925234] [2024-10-13 03:25:32,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:32,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:25:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:32,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:25:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:32,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:25:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:32,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:25:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:32,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:25:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:32,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:25:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:32,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:25:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:32,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:25:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:32,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:25:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:32,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:25:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 03:25:32,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:25:32,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534925234] [2024-10-13 03:25:32,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534925234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:25:32,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:25:32,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 03:25:32,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976423892] [2024-10-13 03:25:32,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:25:32,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 03:25:32,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:25:32,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 03:25:32,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:25:32,911 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:25:33,134 INFO L93 Difference]: Finished difference Result 232 states and 324 transitions. [2024-10-13 03:25:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 03:25:33,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2024-10-13 03:25:33,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:25:33,137 INFO L225 Difference]: With dead ends: 232 [2024-10-13 03:25:33,137 INFO L226 Difference]: Without dead ends: 159 [2024-10-13 03:25:33,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:25:33,138 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 195 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:25:33,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 285 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:25:33,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-13 03:25:33,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2024-10-13 03:25:33,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 128 states have (on average 1.3515625) internal successors, (173), 130 states have internal predecessors, (173), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:25:33,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 213 transitions. [2024-10-13 03:25:33,150 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 213 transitions. Word has length 72 [2024-10-13 03:25:33,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:25:33,150 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 213 transitions. [2024-10-13 03:25:33,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 213 transitions. [2024-10-13 03:25:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 03:25:33,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:33,152 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:33,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 03:25:33,152 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:33,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:33,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1777350140, now seen corresponding path program 1 times [2024-10-13 03:25:33,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:25:33,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360044627] [2024-10-13 03:25:33,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:33,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:25:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:25:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:25:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:25:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:25:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:25:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:25:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:25:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:25:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:25:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,145 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 03:25:34,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:25:34,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360044627] [2024-10-13 03:25:34,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360044627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:25:34,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:25:34,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:25:34,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244037827] [2024-10-13 03:25:34,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:25:34,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:25:34,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:25:34,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:25:34,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:25:34,148 INFO L87 Difference]: Start difference. First operand 153 states and 213 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:25:34,851 INFO L93 Difference]: Finished difference Result 452 states and 630 transitions. [2024-10-13 03:25:34,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:25:34,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2024-10-13 03:25:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:25:34,855 INFO L225 Difference]: With dead ends: 452 [2024-10-13 03:25:34,856 INFO L226 Difference]: Without dead ends: 303 [2024-10-13 03:25:34,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-13 03:25:34,857 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 369 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:25:34,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 177 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 03:25:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-13 03:25:34,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 173. [2024-10-13 03:25:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 148 states have (on average 1.364864864864865) internal successors, (202), 150 states have internal predecessors, (202), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:25:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 242 transitions. [2024-10-13 03:25:34,870 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 242 transitions. Word has length 72 [2024-10-13 03:25:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:25:34,871 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 242 transitions. [2024-10-13 03:25:34,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:34,871 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 242 transitions. [2024-10-13 03:25:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 03:25:34,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:34,873 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:34,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 03:25:34,873 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:34,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:34,874 INFO L85 PathProgramCache]: Analyzing trace with hash 828673414, now seen corresponding path program 1 times [2024-10-13 03:25:34,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:25:34,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843111275] [2024-10-13 03:25:34,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:34,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:25:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:25:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:25:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:25:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:25:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:25:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:25:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:34,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:25:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:35,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:25:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:35,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:25:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 03:25:35,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:25:35,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843111275] [2024-10-13 03:25:35,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843111275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:25:35,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:25:35,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:25:35,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513856419] [2024-10-13 03:25:35,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:25:35,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:25:35,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:25:35,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:25:35,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:25:35,019 INFO L87 Difference]: Start difference. First operand 173 states and 242 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:25:35,114 INFO L93 Difference]: Finished difference Result 489 states and 683 transitions. [2024-10-13 03:25:35,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:25:35,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2024-10-13 03:25:35,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:25:35,118 INFO L225 Difference]: With dead ends: 489 [2024-10-13 03:25:35,118 INFO L226 Difference]: Without dead ends: 320 [2024-10-13 03:25:35,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:25:35,121 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 60 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:25:35,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 163 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:25:35,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-13 03:25:35,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 251. [2024-10-13 03:25:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 215 states have (on average 1.3488372093023255) internal successors, (290), 217 states have internal predecessors, (290), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 03:25:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 348 transitions. [2024-10-13 03:25:35,147 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 348 transitions. Word has length 72 [2024-10-13 03:25:35,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:25:35,148 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 348 transitions. [2024-10-13 03:25:35,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:35,148 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 348 transitions. [2024-10-13 03:25:35,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-13 03:25:35,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:35,149 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:35,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 03:25:35,150 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:35,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:35,150 INFO L85 PathProgramCache]: Analyzing trace with hash 881496481, now seen corresponding path program 1 times [2024-10-13 03:25:35,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:25:35,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698101087] [2024-10-13 03:25:35,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:35,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:25:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:35,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:25:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:35,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:25:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:35,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:25:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:35,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:25:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:35,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:25:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:35,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:25:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:35,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:25:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:35,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:25:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:35,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:25:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:35,310 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-13 03:25:35,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:25:35,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698101087] [2024-10-13 03:25:35,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698101087] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:25:35,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683915167] [2024-10-13 03:25:35,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:35,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:25:35,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:25:35,313 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-13 03:25:35,314 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-13 03:25:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:35,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 03:25:35,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:25:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 03:25:35,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:25:35,789 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-13 03:25:35,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683915167] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:25:35,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 03:25:35,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2024-10-13 03:25:35,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855852116] [2024-10-13 03:25:35,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 03:25:35,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 03:25:35,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:25:35,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 03:25:35,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:25:35,792 INFO L87 Difference]: Start difference. First operand 251 states and 348 transitions. Second operand has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2024-10-13 03:25:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:25:36,350 INFO L93 Difference]: Finished difference Result 839 states and 1130 transitions. [2024-10-13 03:25:36,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-13 03:25:36,351 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) Word has length 73 [2024-10-13 03:25:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:25:36,355 INFO L225 Difference]: With dead ends: 839 [2024-10-13 03:25:36,355 INFO L226 Difference]: Without dead ends: 737 [2024-10-13 03:25:36,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=313, Invalid=877, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 03:25:36,357 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 1086 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:25:36,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 556 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:25:36,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-13 03:25:36,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 267. [2024-10-13 03:25:36,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 209 states have (on average 1.277511961722488) internal successors, (267), 210 states have internal predecessors, (267), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 03:25:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 357 transitions. [2024-10-13 03:25:36,387 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 357 transitions. Word has length 73 [2024-10-13 03:25:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:25:36,388 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 357 transitions. [2024-10-13 03:25:36,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2024-10-13 03:25:36,388 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 357 transitions. [2024-10-13 03:25:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-13 03:25:36,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:36,389 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:36,408 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-13 03:25:36,593 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,SelfDestructingSolverStorable11 [2024-10-13 03:25:36,594 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:36,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:36,594 INFO L85 PathProgramCache]: Analyzing trace with hash 63848031, now seen corresponding path program 1 times [2024-10-13 03:25:36,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:25:36,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457470926] [2024-10-13 03:25:36,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:36,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:25:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:25:36,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:25:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:25:36,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:25:36,664 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:25:36,665 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:25:36,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 03:25:36,670 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:25:36,743 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:25:36,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:25:36 BoogieIcfgContainer [2024-10-13 03:25:36,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:25:36,748 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:25:36,748 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:25:36,749 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:25:36,749 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:25:25" (3/4) ... [2024-10-13 03:25:36,751 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:25:36,752 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:25:36,753 INFO L158 Benchmark]: Toolchain (without parser) took 12235.74ms. Allocated memory was 159.4MB in the beginning and 245.4MB in the end (delta: 86.0MB). Free memory was 91.0MB in the beginning and 127.1MB in the end (delta: -36.1MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2024-10-13 03:25:36,753 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:25:36,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.85ms. Allocated memory is still 159.4MB. Free memory was 90.8MB in the beginning and 76.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 03:25:36,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.30ms. Allocated memory is still 159.4MB. Free memory was 76.9MB in the beginning and 73.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:25:36,754 INFO L158 Benchmark]: Boogie Preprocessor took 77.36ms. Allocated memory is still 159.4MB. Free memory was 73.8MB in the beginning and 70.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:25:36,754 INFO L158 Benchmark]: RCFGBuilder took 643.01ms. Allocated memory is still 159.4MB. Free memory was 70.4MB in the beginning and 119.6MB in the end (delta: -49.2MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-10-13 03:25:36,754 INFO L158 Benchmark]: TraceAbstraction took 11111.01ms. Allocated memory was 159.4MB in the beginning and 245.4MB in the end (delta: 86.0MB). Free memory was 119.6MB in the beginning and 127.1MB in the end (delta: -7.5MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB. [2024-10-13 03:25:36,754 INFO L158 Benchmark]: Witness Printer took 4.55ms. Allocated memory is still 245.4MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:25:36,755 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 121.6MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.85ms. Allocated memory is still 159.4MB. Free memory was 90.8MB in the beginning and 76.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.30ms. Allocated memory is still 159.4MB. Free memory was 76.9MB in the beginning and 73.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.36ms. Allocated memory is still 159.4MB. Free memory was 73.8MB in the beginning and 70.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 643.01ms. Allocated memory is still 159.4MB. Free memory was 70.4MB in the beginning and 119.6MB in the end (delta: -49.2MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11111.01ms. Allocated memory was 159.4MB in the beginning and 245.4MB in the end (delta: 86.0MB). Free memory was 119.6MB in the beginning and 127.1MB in the end (delta: -7.5MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB. * Witness Printer took 4.55ms. Allocated memory is still 245.4MB. Free memory is still 127.1MB. 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 84, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] signed short int var_1_5 = 4; [L24] unsigned char var_1_7 = 200; [L25] unsigned char var_1_8 = 32; [L26] float var_1_9 = 256.5; [L27] float var_1_10 = -0.25; [L28] float var_1_11 = 0.30000000000000004; [L29] float var_1_12 = 49.5; [L30] signed long int var_1_13 = -8; [L31] unsigned char var_1_14 = 0; [L32] float var_1_15 = 0.4; [L33] signed long int var_1_16 = -256; [L34] signed long int last_1_var_1_13 = -8; [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] CALL updateLastVariables() [L81] last_1_var_1_13 = var_1_13 [L91] RET updateLastVariables() [L92] CALL updateVariables() [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L67] var_1_8 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_9=513/2] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_9=513/2] [L69] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L69] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L70] var_1_10 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L71] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L72] var_1_11 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L73] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L74] var_1_12 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L75] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L76] var_1_14 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L92] RET updateVariables() [L93] CALL step() [L38] COND FALSE !(var_1_5 < last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L41] var_1_16 = var_1_7 [L42] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L43] COND TRUE ! var_1_14 [L44] var_1_13 = var_1_8 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=0, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L52] var_1_15 = var_1_11 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] signed long int stepLocal_0 = (var_1_13 ^ var_1_7) + var_1_16; [L54] COND FALSE !(stepLocal_0 < -1) [L57] var_1_1 = (128 - (var_1_7 + var_1_7)) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] COND FALSE !(var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) [L93] RET step() [L94] CALL, EXPR property() [L84] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84-L85] return ((((((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1)) && ((! var_1_14) ? (var_1_13 == ((signed long int) var_1_8)) : ((var_1_7 > (var_1_7 + var_1_7)) ? (var_1_13 == ((signed long int) var_1_7)) : (var_1_13 == ((signed long int) var_1_16))))) && (var_1_15 == ((float) var_1_11))) && (var_1_16 == ((signed long int) var_1_7)) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 13, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2607 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2599 mSDsluCounter, 3069 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2081 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2248 IncrementalHoareTripleChecker+Invalid, 2398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 988 mSDtfsCounter, 2248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 486 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=12, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 1116 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 998 NumberOfCodeBlocks, 998 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 984 ConstructedInterpolants, 0 QuantifiedInterpolants, 5697 SizeOfPredicates, 4 NumberOfNonLiveVariables, 188 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 1944/2016 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-13 03:25:36,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.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 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:25:39,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:25:39,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:25:39,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:25:39,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:25:39,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:25:39,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:25:39,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:25:39,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:25:39,197 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:25:39,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:25:39,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:25:39,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:25:39,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:25:39,201 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:25:39,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:25:39,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:25:39,202 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:25:39,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:25:39,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:25:39,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:25:39,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:25:39,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:25:39,207 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:25:39,207 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:25:39,208 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:25:39,208 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:25:39,208 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:25:39,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:25:39,209 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:25:39,209 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:25:39,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:25:39,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:25:39,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:25:39,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:25:39,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:25:39,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:25:39,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:25:39,212 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:25:39,212 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:25:39,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:25:39,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:25:39,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:25:39,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:25:39,215 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:25:39,215 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 -> 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 [2024-10-13 03:25:39,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:25:39,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:25:39,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:25:39,628 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:25:39,628 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:25:39,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2024-10-13 03:25:41,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:25:41,514 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:25:41,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2024-10-13 03:25:41,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1559692e1/b69b5859f249419894dc9ad841608a6a/FLAGd2f29360a [2024-10-13 03:25:41,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1559692e1/b69b5859f249419894dc9ad841608a6a [2024-10-13 03:25:41,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:25:41,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:25:41,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:25:41,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:25:41,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:25:41,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:25:41" (1/1) ... [2024-10-13 03:25:41,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19b0a14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:41, skipping insertion in model container [2024-10-13 03:25:41,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:25:41" (1/1) ... [2024-10-13 03:25:41,575 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:25:41,787 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i[917,930] [2024-10-13 03:25:41,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:25:41,864 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:25:41,880 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_floatingpointinfluence_has-floats_file-33.i[917,930] [2024-10-13 03:25:41,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:25:41,932 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:25:41,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:41 WrapperNode [2024-10-13 03:25:41,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:25:41,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:25:41,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:25:41,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:25:41,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:41" (1/1) ... [2024-10-13 03:25:41,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:41" (1/1) ... [2024-10-13 03:25:41,984 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-10-13 03:25:41,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:25:41,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:25:41,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:25:41,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:25:42,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:41" (1/1) ... [2024-10-13 03:25:42,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:41" (1/1) ... [2024-10-13 03:25:42,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:41" (1/1) ... [2024-10-13 03:25:42,020 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-13 03:25:42,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:41" (1/1) ... [2024-10-13 03:25:42,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:41" (1/1) ... [2024-10-13 03:25:42,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:41" (1/1) ... [2024-10-13 03:25:42,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:41" (1/1) ... [2024-10-13 03:25:42,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:41" (1/1) ... [2024-10-13 03:25:42,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:41" (1/1) ... [2024-10-13 03:25:42,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:25:42,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:25:42,045 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:25:42,045 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:25:42,046 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:41" (1/1) ... [2024-10-13 03:25:42,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:25:42,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:25:42,081 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-13 03:25:42,085 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-13 03:25:42,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:25:42,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:25:42,133 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:25:42,133 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:25:42,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:25:42,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:25:42,223 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:25:42,226 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:25:43,063 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 03:25:43,063 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:25:43,154 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:25:43,155 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:25:43,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:25:43 BoogieIcfgContainer [2024-10-13 03:25:43,155 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:25:43,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:25:43,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:25:43,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:25:43,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:25:41" (1/3) ... [2024-10-13 03:25:43,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea3e27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:25:43, skipping insertion in model container [2024-10-13 03:25:43,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:25:41" (2/3) ... [2024-10-13 03:25:43,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea3e27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:25:43, skipping insertion in model container [2024-10-13 03:25:43,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:25:43" (3/3) ... [2024-10-13 03:25:43,167 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-33.i [2024-10-13 03:25:43,198 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:25:43,198 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:25:43,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:25:43,279 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;@78516d53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:25:43,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:25:43,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 03:25:43,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 03:25:43,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:43,296 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:43,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:43,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:43,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1056546956, now seen corresponding path program 1 times [2024-10-13 03:25:43,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:25:43,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549705425] [2024-10-13 03:25:43,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:43,320 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-13 03:25:43,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:25:43,324 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-13 03:25:43,326 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-13 03:25:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:43,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:25:43,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:25:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-13 03:25:43,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:25:43,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:25:43,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549705425] [2024-10-13 03:25:43,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549705425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:25:43,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:25:43,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:25:43,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721790465] [2024-10-13 03:25:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:25:43,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:25:43,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:25:43,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:25:43,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:25:43,631 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 03:25:43,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:25:43,888 INFO L93 Difference]: Finished difference Result 67 states and 109 transitions. [2024-10-13 03:25:43,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:25:43,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2024-10-13 03:25:43,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:25:43,904 INFO L225 Difference]: With dead ends: 67 [2024-10-13 03:25:43,904 INFO L226 Difference]: Without dead ends: 33 [2024-10-13 03:25:43,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 61 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-13 03:25:43,913 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:25:43,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:25:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-13 03:25:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-13 03:25:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 03:25:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2024-10-13 03:25:43,948 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 62 [2024-10-13 03:25:43,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:25:43,948 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2024-10-13 03:25:43,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 03:25:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2024-10-13 03:25:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 03:25:43,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:43,951 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:43,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 03:25:44,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:25:44,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:44,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:44,154 INFO L85 PathProgramCache]: Analyzing trace with hash 924409454, now seen corresponding path program 1 times [2024-10-13 03:25:44,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:25:44,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545054359] [2024-10-13 03:25:44,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:44,155 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-13 03:25:44,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:25:44,159 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:25:44,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 03:25:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:44,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 03:25:44,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:25:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 03:25:45,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:25:45,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:25:45,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545054359] [2024-10-13 03:25:45,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545054359] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:25:45,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [325662497] [2024-10-13 03:25:45,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:45,290 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 03:25:45,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 03:25:45,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 03:25:45,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-13 03:25:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:45,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 03:25:45,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:25:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 03:25:45,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:25:45,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [325662497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:25:45,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 03:25:45,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-10-13 03:25:45,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491299808] [2024-10-13 03:25:45,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:25:45,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:25:45,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:25:45,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:25:45,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-13 03:25:45,878 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:25:46,438 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2024-10-13 03:25:46,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:25:46,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2024-10-13 03:25:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:25:46,442 INFO L225 Difference]: With dead ends: 89 [2024-10-13 03:25:46,442 INFO L226 Difference]: Without dead ends: 57 [2024-10-13 03:25:46,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-13 03:25:46,444 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 39 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:25:46,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 189 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 03:25:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-13 03:25:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33. [2024-10-13 03:25:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 03:25:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-10-13 03:25:46,454 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 62 [2024-10-13 03:25:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:25:46,456 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-10-13 03:25:46,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 03:25:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-10-13 03:25:46,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 03:25:46,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:46,458 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:46,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-13 03:25:46,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 03:25:46,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:25:46,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:46,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:46,861 INFO L85 PathProgramCache]: Analyzing trace with hash 926316078, now seen corresponding path program 1 times [2024-10-13 03:25:46,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:25:46,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982682770] [2024-10-13 03:25:46,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:46,862 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-13 03:25:46,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:25:46,865 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:25:46,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 03:25:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:47,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 03:25:47,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:25:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 03:25:47,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:25:47,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:25:47,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982682770] [2024-10-13 03:25:47,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982682770] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:25:47,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1801977098] [2024-10-13 03:25:47,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:47,600 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 03:25:47,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 03:25:47,603 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 03:25:47,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-13 03:25:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:48,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 03:25:48,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:25:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 03:25:48,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:25:48,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1801977098] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:25:48,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 03:25:48,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-13 03:25:48,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478153722] [2024-10-13 03:25:48,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 03:25:48,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 03:25:48,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:25:48,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 03:25:48,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:25:48,497 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 03:25:49,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:25:49,576 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2024-10-13 03:25:49,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 03:25:49,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2024-10-13 03:25:49,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:25:49,586 INFO L225 Difference]: With dead ends: 104 [2024-10-13 03:25:49,587 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 03:25:49,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-13 03:25:49,588 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 42 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 03:25:49,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 149 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 03:25:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 03:25:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2024-10-13 03:25:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:25:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2024-10-13 03:25:49,606 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 62 [2024-10-13 03:25:49,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:25:49,606 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2024-10-13 03:25:49,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 03:25:49,607 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2024-10-13 03:25:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 03:25:49,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:25:49,608 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:25:49,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 03:25:49,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-10-13 03:25:50,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 03:25:50,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:25:50,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:25:50,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1606374448, now seen corresponding path program 1 times [2024-10-13 03:25:50,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:25:50,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761309076] [2024-10-13 03:25:50,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:25:50,018 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-13 03:25:50,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:25:50,022 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:25:50,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 03:25:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:25:50,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 03:25:50,186 INFO L278 TraceCheckSpWp]: Computing forward predicates...