./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-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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-13.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 3653ee9b8dc6b7aee8e6b7da10ac828d65da62269c83c8e52fa2ba1e8499c5f1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:48:45,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:48:45,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:48:45,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:48:45,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:48:45,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:48:45,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:48:45,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:48:45,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:48:45,609 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:48:45,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:48:45,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:48:45,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:48:45,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:48:45,610 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:48:45,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:48:45,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:48:45,612 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:48:45,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:48:45,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:48:45,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:48:45,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:48:45,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:48:45,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:48:45,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:48:45,618 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:48:45,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:48:45,618 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:48:45,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:48:45,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:48:45,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:48:45,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:48:45,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:48:45,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:48:45,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:48:45,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:48:45,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:48:45,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:48:45,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:48:45,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:48:45,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:48:45,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:48:45,621 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 -> 3653ee9b8dc6b7aee8e6b7da10ac828d65da62269c83c8e52fa2ba1e8499c5f1 [2024-11-20 05:48:45,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:48:45,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:48:45,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:48:45,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:48:45,833 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:48:45,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-13.i [2024-11-20 05:48:47,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:48:47,211 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:48:47,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-13.i [2024-11-20 05:48:47,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541d82aca/92350f465c174b69b28d9f368cb690f5/FLAGe1d778c0c [2024-11-20 05:48:47,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541d82aca/92350f465c174b69b28d9f368cb690f5 [2024-11-20 05:48:47,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:48:47,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:48:47,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:48:47,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:48:47,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:48:47,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:48:47" (1/1) ... [2024-11-20 05:48:47,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41328301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:47, skipping insertion in model container [2024-11-20 05:48:47,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:48:47" (1/1) ... [2024-11-20 05:48:47,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:48:47,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-13.i[917,930] [2024-11-20 05:48:47,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:48:47,854 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:48:47,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-13.i[917,930] [2024-11-20 05:48:47,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:48:47,894 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:48:47,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:47 WrapperNode [2024-11-20 05:48:47,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:48:47,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:48:47,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:48:47,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:48:47,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:47" (1/1) ... [2024-11-20 05:48:47,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:47" (1/1) ... [2024-11-20 05:48:47,937 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-11-20 05:48:47,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:48:47,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:48:47,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:48:47,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:48:47,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:47" (1/1) ... [2024-11-20 05:48:47,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:47" (1/1) ... [2024-11-20 05:48:47,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:47" (1/1) ... [2024-11-20 05:48:47,967 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 05:48:47,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:47" (1/1) ... [2024-11-20 05:48:47,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:47" (1/1) ... [2024-11-20 05:48:47,977 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:47" (1/1) ... [2024-11-20 05:48:47,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:47" (1/1) ... [2024-11-20 05:48:47,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:47" (1/1) ... [2024-11-20 05:48:47,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:47" (1/1) ... [2024-11-20 05:48:47,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:48:47,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:48:47,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:48:47,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:48:47,988 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:47" (1/1) ... [2024-11-20 05:48:47,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:48:48,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:48:48,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 05:48:48,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 05:48:48,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:48:48,059 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:48:48,059 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:48:48,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:48:48,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:48:48,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:48:48,117 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:48:48,119 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:48:48,326 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-20 05:48:48,326 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:48:48,336 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:48:48,336 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:48:48,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:48:48 BoogieIcfgContainer [2024-11-20 05:48:48,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:48:48,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:48:48,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:48:48,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:48:48,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:48:47" (1/3) ... [2024-11-20 05:48:48,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f97575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:48:48, skipping insertion in model container [2024-11-20 05:48:48,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:47" (2/3) ... [2024-11-20 05:48:48,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f97575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:48:48, skipping insertion in model container [2024-11-20 05:48:48,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:48:48" (3/3) ... [2024-11-20 05:48:48,345 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-13.i [2024-11-20 05:48:48,356 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:48:48,357 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:48:48,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:48:48,407 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;@26a7361c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:48:48,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:48:48,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 05:48:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 05:48:48,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:48:48,418 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:48:48,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:48:48,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:48:48,422 INFO L85 PathProgramCache]: Analyzing trace with hash 744628402, now seen corresponding path program 1 times [2024-11-20 05:48:48,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:48:48,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303619580] [2024-11-20 05:48:48,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:48:48,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:48:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:48,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:48:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:48,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:48:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:48,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:48:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:48,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:48:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:48,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 05:48:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:48,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:48:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:48,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 05:48:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:48,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:48:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:48,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 05:48:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:48,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:48:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:48,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 05:48:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:48,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:48:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:48,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:48:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:48,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:48:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:48,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:48:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 05:48:48,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:48:48,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303619580] [2024-11-20 05:48:48,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303619580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:48:48,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:48:48,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:48:48,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354850295] [2024-11-20 05:48:48,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:48:48,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:48:48,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:48:48,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:48:48,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:48:48,715 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 05:48:48,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:48:48,740 INFO L93 Difference]: Finished difference Result 91 states and 151 transitions. [2024-11-20 05:48:48,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:48:48,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-11-20 05:48:48,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:48:48,749 INFO L225 Difference]: With dead ends: 91 [2024-11-20 05:48:48,749 INFO L226 Difference]: Without dead ends: 45 [2024-11-20 05:48:48,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-11-20 05:48:48,754 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:48:48,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:48:48,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-20 05:48:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-20 05:48:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 05:48:48,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2024-11-20 05:48:48,787 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 98 [2024-11-20 05:48:48,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:48:48,788 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2024-11-20 05:48:48,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 05:48:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2024-11-20 05:48:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 05:48:48,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:48:48,791 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:48:48,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:48:48,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:48:48,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:48:48,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1203141465, now seen corresponding path program 1 times [2024-11-20 05:48:48,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:48:48,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703173396] [2024-11-20 05:48:48,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:48:48,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:48:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:50,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:48:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:50,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:48:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:50,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:48:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:50,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:48:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:50,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 05:48:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:50,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:48:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:50,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 05:48:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:50,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:48:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:50,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 05:48:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:50,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:48:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:50,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 05:48:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:50,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:48:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:50,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:48:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:50,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:48:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:50,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:48:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 05:48:50,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:48:50,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703173396] [2024-11-20 05:48:50,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703173396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:48:50,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:48:50,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 05:48:50,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358306337] [2024-11-20 05:48:50,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:48:50,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 05:48:50,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:48:50,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 05:48:50,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:48:50,185 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:48:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:48:50,508 INFO L93 Difference]: Finished difference Result 118 states and 157 transitions. [2024-11-20 05:48:50,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 05:48:50,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-20 05:48:50,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:48:50,512 INFO L225 Difference]: With dead ends: 118 [2024-11-20 05:48:50,512 INFO L226 Difference]: Without dead ends: 116 [2024-11-20 05:48:50,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-20 05:48:50,513 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 108 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:48:50,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 452 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:48:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-20 05:48:50,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 92. [2024-11-20 05:48:50,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 05:48:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2024-11-20 05:48:50,534 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 99 [2024-11-20 05:48:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:48:50,534 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2024-11-20 05:48:50,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:48:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2024-11-20 05:48:50,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 05:48:50,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:48:50,539 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:48:50,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:48:50,539 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:48:50,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:48:50,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1204988507, now seen corresponding path program 1 times [2024-11-20 05:48:50,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:48:50,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208597775] [2024-11-20 05:48:50,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:48:50,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:48:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:51,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:48:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:51,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:48:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:51,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:48:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:51,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:48:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:51,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 05:48:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:51,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:48:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:51,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 05:48:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:51,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:48:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:51,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 05:48:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:51,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:48:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:51,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 05:48:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:51,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:48:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:51,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:48:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:51,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:48:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:51,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:48:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:51,239 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 05:48:51,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:48:51,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208597775] [2024-11-20 05:48:51,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208597775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:48:51,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:48:51,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 05:48:51,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104251876] [2024-11-20 05:48:51,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:48:51,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 05:48:51,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:48:51,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 05:48:51,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:48:51,243 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:48:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:48:51,499 INFO L93 Difference]: Finished difference Result 116 states and 155 transitions. [2024-11-20 05:48:51,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 05:48:51,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-20 05:48:51,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:48:51,501 INFO L225 Difference]: With dead ends: 116 [2024-11-20 05:48:51,501 INFO L226 Difference]: Without dead ends: 114 [2024-11-20 05:48:51,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-20 05:48:51,502 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 111 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:48:51,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 418 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:48:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-20 05:48:51,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92. [2024-11-20 05:48:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 05:48:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2024-11-20 05:48:51,513 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 99 [2024-11-20 05:48:51,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:48:51,514 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2024-11-20 05:48:51,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:48:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2024-11-20 05:48:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 05:48:51,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:48:51,515 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:48:51,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:48:51,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:48:51,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:48:51,516 INFO L85 PathProgramCache]: Analyzing trace with hash 393794839, now seen corresponding path program 1 times [2024-11-20 05:48:51,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:48:51,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367426107] [2024-11-20 05:48:51,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:48:51,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:48:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:52,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:48:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:52,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:48:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:52,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:48:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:52,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:48:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:52,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 05:48:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:52,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:48:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:52,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 05:48:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:52,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:48:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:52,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 05:48:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:52,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:48:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:52,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 05:48:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:52,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:48:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:52,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:48:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:52,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:48:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:52,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:48:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:52,179 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 05:48:52,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:48:52,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367426107] [2024-11-20 05:48:52,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367426107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:48:52,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:48:52,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 05:48:52,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864414073] [2024-11-20 05:48:52,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:48:52,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 05:48:52,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:48:52,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 05:48:52,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:48:52,181 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:48:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:48:52,418 INFO L93 Difference]: Finished difference Result 116 states and 155 transitions. [2024-11-20 05:48:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 05:48:52,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-20 05:48:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:48:52,420 INFO L225 Difference]: With dead ends: 116 [2024-11-20 05:48:52,420 INFO L226 Difference]: Without dead ends: 114 [2024-11-20 05:48:52,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-20 05:48:52,423 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 87 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:48:52,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 516 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:48:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-20 05:48:52,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2024-11-20 05:48:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 05:48:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2024-11-20 05:48:52,436 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 99 [2024-11-20 05:48:52,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:48:52,437 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2024-11-20 05:48:52,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:48:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2024-11-20 05:48:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 05:48:52,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:48:52,439 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:48:52,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 05:48:52,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:48:52,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:48:52,442 INFO L85 PathProgramCache]: Analyzing trace with hash 395641881, now seen corresponding path program 1 times [2024-11-20 05:48:52,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:48:52,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481467134] [2024-11-20 05:48:52,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:48:52,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:48:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:48:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:48:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:48:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:48:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 05:48:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:48:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 05:48:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:48:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 05:48:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:48:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 05:48:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:48:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:48:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:48:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:48:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 05:48:53,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:48:53,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481467134] [2024-11-20 05:48:53,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481467134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:48:53,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:48:53,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 05:48:53,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795810317] [2024-11-20 05:48:53,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:48:53,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 05:48:53,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:48:53,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 05:48:53,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:48:53,070 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:48:53,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:48:53,312 INFO L93 Difference]: Finished difference Result 114 states and 153 transitions. [2024-11-20 05:48:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 05:48:53,312 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-20 05:48:53,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:48:53,313 INFO L225 Difference]: With dead ends: 114 [2024-11-20 05:48:53,313 INFO L226 Difference]: Without dead ends: 112 [2024-11-20 05:48:53,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-20 05:48:53,314 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 90 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:48:53,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 493 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:48:53,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-20 05:48:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2024-11-20 05:48:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 05:48:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2024-11-20 05:48:53,323 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 99 [2024-11-20 05:48:53,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:48:53,323 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2024-11-20 05:48:53,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:48:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2024-11-20 05:48:53,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 05:48:53,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:48:53,324 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:48:53,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 05:48:53,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:48:53,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:48:53,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1883199835, now seen corresponding path program 1 times [2024-11-20 05:48:53,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:48:53,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913280226] [2024-11-20 05:48:53,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:48:53,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:48:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:48:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:48:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:48:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:48:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 05:48:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:48:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 05:48:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:48:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 05:48:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:48:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 05:48:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:48:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:48:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:48:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:48:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 05:48:53,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:48:53,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913280226] [2024-11-20 05:48:53,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913280226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:48:53,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:48:53,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 05:48:53,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080808714] [2024-11-20 05:48:53,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:48:53,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 05:48:53,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:48:53,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 05:48:53,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 05:48:53,875 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:48:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:48:54,308 INFO L93 Difference]: Finished difference Result 195 states and 271 transitions. [2024-11-20 05:48:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 05:48:54,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-20 05:48:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:48:54,310 INFO L225 Difference]: With dead ends: 195 [2024-11-20 05:48:54,310 INFO L226 Difference]: Without dead ends: 193 [2024-11-20 05:48:54,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-20 05:48:54,311 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 181 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 05:48:54,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 596 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 05:48:54,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-20 05:48:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2024-11-20 05:48:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 113 states have internal predecessors, (136), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 05:48:54,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 256 transitions. [2024-11-20 05:48:54,337 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 256 transitions. Word has length 99 [2024-11-20 05:48:54,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:48:54,340 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 256 transitions. [2024-11-20 05:48:54,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:48:54,341 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 256 transitions. [2024-11-20 05:48:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 05:48:54,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:48:54,341 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:48:54,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 05:48:54,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:48:54,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:48:54,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1885046877, now seen corresponding path program 1 times [2024-11-20 05:48:54,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:48:54,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694352721] [2024-11-20 05:48:54,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:48:54,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:48:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:54,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:48:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:54,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:48:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:54,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:48:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:54,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:48:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:54,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 05:48:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:54,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:48:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:54,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 05:48:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:54,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:48:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:54,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 05:48:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:54,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:48:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:54,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 05:48:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:54,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:48:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:54,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:48:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:54,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:48:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:54,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:48:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 05:48:54,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:48:54,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694352721] [2024-11-20 05:48:54,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694352721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:48:54,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:48:54,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 05:48:54,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618495729] [2024-11-20 05:48:54,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:48:54,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 05:48:54,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:48:54,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 05:48:54,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-20 05:48:54,799 INFO L87 Difference]: Start difference. First operand 178 states and 256 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:48:55,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:48:55,077 INFO L93 Difference]: Finished difference Result 193 states and 269 transitions. [2024-11-20 05:48:55,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 05:48:55,078 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-20 05:48:55,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:48:55,079 INFO L225 Difference]: With dead ends: 193 [2024-11-20 05:48:55,079 INFO L226 Difference]: Without dead ends: 191 [2024-11-20 05:48:55,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-20 05:48:55,082 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 132 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:48:55,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 514 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:48:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-20 05:48:55,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2024-11-20 05:48:55,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 113 states have internal predecessors, (136), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 05:48:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 256 transitions. [2024-11-20 05:48:55,099 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 256 transitions. Word has length 99 [2024-11-20 05:48:55,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:48:55,100 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 256 transitions. [2024-11-20 05:48:55,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:48:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 256 transitions. [2024-11-20 05:48:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 05:48:55,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:48:55,101 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:48:55,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 05:48:55,101 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:48:55,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:48:55,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1073853209, now seen corresponding path program 1 times [2024-11-20 05:48:55,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:48:55,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925562513] [2024-11-20 05:48:55,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:48:55,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:48:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:55,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:48:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:55,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:48:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:55,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:48:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:55,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:48:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:55,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 05:48:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:55,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:48:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:55,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 05:48:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:55,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:48:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:55,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 05:48:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:55,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:48:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:55,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 05:48:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:55,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:48:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:55,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:48:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:55,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:48:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:55,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:48:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 05:48:55,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:48:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925562513] [2024-11-20 05:48:55,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925562513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:48:55,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:48:55,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 05:48:55,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309122307] [2024-11-20 05:48:55,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:48:55,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 05:48:55,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:48:55,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 05:48:55,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 05:48:55,593 INFO L87 Difference]: Start difference. First operand 178 states and 256 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:48:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:48:55,831 INFO L93 Difference]: Finished difference Result 200 states and 278 transitions. [2024-11-20 05:48:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 05:48:55,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-20 05:48:55,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:48:55,833 INFO L225 Difference]: With dead ends: 200 [2024-11-20 05:48:55,833 INFO L226 Difference]: Without dead ends: 198 [2024-11-20 05:48:55,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-20 05:48:55,834 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 68 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:48:55,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 438 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:48:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-20 05:48:55,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 178. [2024-11-20 05:48:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 113 states have internal predecessors, (136), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 05:48:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 256 transitions. [2024-11-20 05:48:55,844 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 256 transitions. Word has length 99 [2024-11-20 05:48:55,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:48:55,845 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 256 transitions. [2024-11-20 05:48:55,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:48:55,845 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 256 transitions. [2024-11-20 05:48:55,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 05:48:55,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:48:55,846 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:48:55,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 05:48:55,846 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:48:55,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:48:55,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1075700251, now seen corresponding path program 1 times [2024-11-20 05:48:55,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:48:55,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306331216] [2024-11-20 05:48:55,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:48:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:48:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:56,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:48:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:56,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:48:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:56,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:48:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:56,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:48:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:56,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 05:48:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:56,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:48:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:56,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 05:48:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:56,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:48:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:56,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 05:48:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:56,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:48:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:56,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 05:48:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:56,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:48:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:56,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:48:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:56,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:48:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:56,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:48:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:48:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 05:48:56,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:48:56,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306331216] [2024-11-20 05:48:56,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306331216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:48:56,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:48:56,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 05:48:56,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95981302] [2024-11-20 05:48:56,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:48:56,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 05:48:56,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:48:56,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 05:48:56,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:48:56,189 INFO L87 Difference]: Start difference. First operand 178 states and 256 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:48:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:48:56,438 INFO L93 Difference]: Finished difference Result 212 states and 290 transitions. [2024-11-20 05:48:56,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 05:48:56,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-20 05:48:56,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:48:56,442 INFO L225 Difference]: With dead ends: 212 [2024-11-20 05:48:56,442 INFO L226 Difference]: Without dead ends: 210 [2024-11-20 05:48:56,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-20 05:48:56,443 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 80 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:48:56,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 565 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:48:56,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-20 05:48:56,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 172. [2024-11-20 05:48:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 107 states have (on average 1.1962616822429906) internal successors, (128), 107 states have internal predecessors, (128), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 05:48:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 248 transitions. [2024-11-20 05:48:56,457 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 248 transitions. Word has length 99 [2024-11-20 05:48:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:48:56,458 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 248 transitions. [2024-11-20 05:48:56,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:48:56,459 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 248 transitions. [2024-11-20 05:48:56,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 05:48:56,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:48:56,459 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:48:56,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 05:48:56,460 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:48:56,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:48:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash 810114455, now seen corresponding path program 1 times [2024-11-20 05:48:56,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:48:56,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285691136] [2024-11-20 05:48:56,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:48:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:48:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 05:48:56,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1051352029] [2024-11-20 05:48:56,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:48:56,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:48:56,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:48:56,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:48:56,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 05:48:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:48:56,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 05:48:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:48:56,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 05:48:56,655 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 05:48:56,655 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:48:56,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 05:48:56,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-20 05:48:56,866 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:48:56,932 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:48:56,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:48:56 BoogieIcfgContainer [2024-11-20 05:48:56,935 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:48:56,936 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:48:56,936 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:48:56,936 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:48:56,936 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:48:48" (3/4) ... [2024-11-20 05:48:56,938 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 05:48:56,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:48:56,939 INFO L158 Benchmark]: Toolchain (without parser) took 9325.49ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 111.7MB in the beginning and 287.9MB in the end (delta: -176.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:48:56,939 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 96.5MB. Free memory is still 49.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:48:56,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.17ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 132.7MB in the end (delta: -21.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 05:48:56,939 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.87ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 130.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 05:48:56,940 INFO L158 Benchmark]: Boogie Preprocessor took 45.69ms. Allocated memory is still 167.8MB. Free memory was 130.0MB in the beginning and 127.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 05:48:56,940 INFO L158 Benchmark]: RCFGBuilder took 352.60ms. Allocated memory is still 167.8MB. Free memory was 126.5MB in the beginning and 111.1MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 05:48:56,940 INFO L158 Benchmark]: TraceAbstraction took 8595.24ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 110.4MB in the beginning and 287.9MB in the end (delta: -177.5MB). Peak memory consumption was 170.6MB. Max. memory is 16.1GB. [2024-11-20 05:48:56,940 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 325.1MB. Free memory is still 287.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:48:56,941 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 96.5MB. Free memory is still 49.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.17ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 132.7MB in the end (delta: -21.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.87ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 130.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.69ms. Allocated memory is still 167.8MB. Free memory was 130.0MB in the beginning and 127.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 352.60ms. Allocated memory is still 167.8MB. Free memory was 126.5MB in the beginning and 111.1MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8595.24ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 110.4MB in the beginning and 287.9MB in the end (delta: -177.5MB). Peak memory consumption was 170.6MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 325.1MB. Free memory is still 287.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 25; [L23] unsigned char var_1_2 = 1; [L24] signed char var_1_5 = 16; [L25] unsigned short int var_1_6 = 16; [L26] signed char var_1_7 = 4; [L27] unsigned short int var_1_8 = 2; [L28] signed char var_1_9 = 64; [L29] signed char var_1_10 = 0; [L30] unsigned char var_1_11 = 16; [L31] double var_1_12 = 128.4; [L32] double var_1_13 = 50.2; [L33] double var_1_14 = 3.8; [L34] double var_1_15 = 25.1; VAL [isInitial=0, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] FCALL updateLastVariables() [L96] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L62] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L62] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L63] var_1_6 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L65] CALL assume_abort_if_not(var_1_6 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L65] RET assume_abort_if_not(var_1_6 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L66] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64] [L66] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64] [L67] var_1_7 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L68] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L69] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L69] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L70] var_1_9 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_9 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L71] RET assume_abort_if_not(var_1_9 >= 63) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L72] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L72] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L73] var_1_10 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L74] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L75] CALL assume_abort_if_not(var_1_10 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L75] RET assume_abort_if_not(var_1_10 <= 64) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L76] var_1_12 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L77] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L78] var_1_13 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L79] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L80] var_1_14 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L81] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L82] var_1_15 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L83] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L96] RET updateVariables() [L97] CALL step() [L38] COND FALSE !(((var_1_12 - var_1_13) + var_1_14) <= (256.625 * ((((1.875) > (var_1_15)) ? (1.875) : (var_1_15))))) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L44] COND TRUE (var_1_1 == 16) || (var_1_11 < (10 / var_1_6)) [L45] var_1_5 = var_1_7 VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L49] unsigned char stepLocal_1 = var_1_11; [L50] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_1=16, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L51] COND TRUE stepLocal_0 || (var_1_11 >= var_1_11) VAL [isInitial=1, stepLocal_1=16, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L52] COND TRUE stepLocal_1 < ((var_1_9 - var_1_10) - 16) [L53] var_1_8 = ((((var_1_10) > (32)) ? (var_1_10) : (32))) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=63] [L97] RET step() [L98] CALL, EXPR property() [L88-L89] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))))) : 1) && (((var_1_1 == 16) || (var_1_11 < (10 / var_1_6))) ? (var_1_5 == ((signed char) var_1_7)) : (var_1_5 == ((signed char) 5)))) && ((var_1_2 || (var_1_11 >= var_1_11)) ? ((var_1_11 < ((var_1_9 - var_1_10) - 16)) ? (var_1_8 == ((unsigned short int) ((((var_1_10) > (32)) ? (var_1_10) : (32))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11))))))) && ((((var_1_12 - var_1_13) + var_1_14) <= (256.625 * ((((1.875) > (var_1_15)) ? (1.875) : (var_1_15))))) ? (var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=63] [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=63] [L19] reach_error() VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 857 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 857 mSDsluCounter, 4055 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3116 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1421 IncrementalHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 939 mSDtfsCounter, 1421 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=6, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 171 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1088 NumberOfCodeBlocks, 1088 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 881 ConstructedInterpolants, 0 QuantifiedInterpolants, 2802 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 3780/3780 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 05:48:56,971 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-13.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 3653ee9b8dc6b7aee8e6b7da10ac828d65da62269c83c8e52fa2ba1e8499c5f1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:48:58,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:48:58,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 05:48:58,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:48:58,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:48:58,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:48:58,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:48:58,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:48:58,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:48:58,958 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:48:58,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:48:58,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:48:58,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:48:58,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:48:58,962 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:48:58,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:48:58,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:48:58,965 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:48:58,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:48:58,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:48:58,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:48:58,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:48:58,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:48:58,969 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 05:48:58,969 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 05:48:58,969 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:48:58,969 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 05:48:58,970 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:48:58,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:48:58,970 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:48:58,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:48:58,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:48:58,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:48:58,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:48:58,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:48:58,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:48:58,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:48:58,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:48:58,972 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 05:48:58,972 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 05:48:58,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:48:58,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:48:58,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:48:58,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:48:58,974 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 -> 3653ee9b8dc6b7aee8e6b7da10ac828d65da62269c83c8e52fa2ba1e8499c5f1 [2024-11-20 05:48:59,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:48:59,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:48:59,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:48:59,276 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:48:59,277 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:48:59,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-13.i [2024-11-20 05:49:00,518 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:49:00,689 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:49:00,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-13.i [2024-11-20 05:49:00,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba4afd38d/9a097fd35e214557b7b41f220ad8eaec/FLAG79eacf29b [2024-11-20 05:49:01,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba4afd38d/9a097fd35e214557b7b41f220ad8eaec [2024-11-20 05:49:01,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:49:01,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:49:01,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:49:01,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:49:01,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:49:01,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:49:01" (1/1) ... [2024-11-20 05:49:01,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd5d96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:01, skipping insertion in model container [2024-11-20 05:49:01,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:49:01" (1/1) ... [2024-11-20 05:49:01,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:49:01,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-13.i[917,930] [2024-11-20 05:49:01,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:49:01,332 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:49:01,342 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-13.i[917,930] [2024-11-20 05:49:01,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:49:01,385 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:49:01,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:01 WrapperNode [2024-11-20 05:49:01,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:49:01,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:49:01,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:49:01,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:49:01,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:01" (1/1) ... [2024-11-20 05:49:01,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:01" (1/1) ... [2024-11-20 05:49:01,427 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-20 05:49:01,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:49:01,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:49:01,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:49:01,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:49:01,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:01" (1/1) ... [2024-11-20 05:49:01,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:01" (1/1) ... [2024-11-20 05:49:01,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:01" (1/1) ... [2024-11-20 05:49:01,456 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 05:49:01,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:01" (1/1) ... [2024-11-20 05:49:01,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:01" (1/1) ... [2024-11-20 05:49:01,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:01" (1/1) ... [2024-11-20 05:49:01,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:01" (1/1) ... [2024-11-20 05:49:01,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:01" (1/1) ... [2024-11-20 05:49:01,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:01" (1/1) ... [2024-11-20 05:49:01,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:49:01,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:49:01,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:49:01,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:49:01,489 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:01" (1/1) ... [2024-11-20 05:49:01,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:49:01,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:49:01,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 05:49:01,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 05:49:01,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:49:01,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 05:49:01,555 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:49:01,555 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:49:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:49:01,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:49:01,611 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:49:01,613 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:49:07,308 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-20 05:49:07,309 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:49:07,318 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:49:07,318 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:49:07,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:49:07 BoogieIcfgContainer [2024-11-20 05:49:07,319 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:49:07,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:49:07,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:49:07,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:49:07,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:49:01" (1/3) ... [2024-11-20 05:49:07,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3045448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:49:07, skipping insertion in model container [2024-11-20 05:49:07,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:01" (2/3) ... [2024-11-20 05:49:07,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3045448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:49:07, skipping insertion in model container [2024-11-20 05:49:07,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:49:07" (3/3) ... [2024-11-20 05:49:07,327 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-13.i [2024-11-20 05:49:07,341 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:49:07,341 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:49:07,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:49:07,400 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;@1b9df5b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:49:07,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:49:07,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 05:49:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 05:49:07,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:49:07,414 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:49:07,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:49:07,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:49:07,420 INFO L85 PathProgramCache]: Analyzing trace with hash 744628402, now seen corresponding path program 1 times [2024-11-20 05:49:07,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:49:07,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096834430] [2024-11-20 05:49:07,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:49:07,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:49:07,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:49:07,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:49:07,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 05:49:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:07,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 05:49:07,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:49:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-20 05:49:07,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:49:07,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:49:07,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096834430] [2024-11-20 05:49:07,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096834430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:49:07,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:49:07,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:49:07,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483349699] [2024-11-20 05:49:07,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:49:07,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:49:07,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:49:07,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:49:07,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:49:07,795 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 05:49:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:49:07,816 INFO L93 Difference]: Finished difference Result 91 states and 151 transitions. [2024-11-20 05:49:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:49:07,818 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-11-20 05:49:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:49:07,823 INFO L225 Difference]: With dead ends: 91 [2024-11-20 05:49:07,824 INFO L226 Difference]: Without dead ends: 45 [2024-11-20 05:49:07,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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-11-20 05:49:07,830 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:49:07,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:49:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-20 05:49:07,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-20 05:49:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 05:49:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2024-11-20 05:49:07,861 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 98 [2024-11-20 05:49:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:49:07,862 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2024-11-20 05:49:07,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 05:49:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2024-11-20 05:49:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 05:49:07,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:49:07,865 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:49:07,876 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-11-20 05:49:08,066 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-11-20 05:49:08,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:49:08,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:49:08,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1203141465, now seen corresponding path program 1 times [2024-11-20 05:49:08,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:49:08,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274851077] [2024-11-20 05:49:08,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:49:08,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:49:08,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:49:08,072 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-11-20 05:49:08,073 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-11-20 05:49:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:08,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 05:49:08,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:49:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 05:49:08,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:49:08,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:49:08,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274851077] [2024-11-20 05:49:08,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274851077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:49:08,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:49:08,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:49:08,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173839068] [2024-11-20 05:49:08,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:49:08,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:49:08,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:49:08,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:49:08,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:49:08,501 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:49:09,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:49:12,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:49:13,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:49:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:49:13,605 INFO L93 Difference]: Finished difference Result 171 states and 243 transitions. [2024-11-20 05:49:13,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:49:13,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-20 05:49:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:49:13,624 INFO L225 Difference]: With dead ends: 171 [2024-11-20 05:49:13,633 INFO L226 Difference]: Without dead ends: 129 [2024-11-20 05:49:13,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:49:13,635 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 141 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:49:13,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 182 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-20 05:49:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-20 05:49:13,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2024-11-20 05:49:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 76 states have internal predecessors, (90), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-20 05:49:13,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 180 transitions. [2024-11-20 05:49:13,666 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 180 transitions. Word has length 99 [2024-11-20 05:49:13,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:49:13,667 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 180 transitions. [2024-11-20 05:49:13,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 05:49:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 180 transitions. [2024-11-20 05:49:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 05:49:13,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:49:13,668 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:49:13,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 05:49:13,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:49:13,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:49:13,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:49:13,870 INFO L85 PathProgramCache]: Analyzing trace with hash 393794839, now seen corresponding path program 1 times [2024-11-20 05:49:13,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:49:13,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836188821] [2024-11-20 05:49:13,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:49:13,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:49:13,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:49:13,873 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:49:13,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 05:49:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:14,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 05:49:14,109 INFO L278 TraceCheckSpWp]: Computing forward predicates...