./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-83.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 f0343b048050125a5905463af6d7877f94dec42ff05d99e3ac24dce58bdf9f5e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:03:55,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:03:55,731 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:03:55,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:03:55,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:03:55,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:03:55,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:03:55,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:03:55,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:03:55,753 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:03:55,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:03:55,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:03:55,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:03:55,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:03:55,755 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:03:55,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:03:55,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:03:55,755 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:03:55,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:03:55,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:03:55,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:03:55,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:03:55,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:03:55,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:03:55,760 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:03:55,760 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:03:55,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:03:55,761 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:03:55,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:03:55,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:03:55,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:03:55,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:03:55,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:03:55,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:03:55,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:03:55,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:03:55,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:03:55,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:03:55,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:03:55,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:03:55,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:03:55,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:03:55,767 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 -> f0343b048050125a5905463af6d7877f94dec42ff05d99e3ac24dce58bdf9f5e [2024-11-08 23:03:55,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:03:56,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:03:56,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:03:56,005 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:03:56,006 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:03:56,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-83.i [2024-11-08 23:03:57,376 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:03:57,533 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:03:57,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-83.i [2024-11-08 23:03:57,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d00baa40/759bc4d14eb94813b2f5fce93c5c7ee0/FLAGc008ea3e9 [2024-11-08 23:03:57,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d00baa40/759bc4d14eb94813b2f5fce93c5c7ee0 [2024-11-08 23:03:57,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:03:57,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:03:57,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:03:57,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:03:57,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:03:57,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:03:57" (1/1) ... [2024-11-08 23:03:57,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d583dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:57, skipping insertion in model container [2024-11-08 23:03:57,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:03:57" (1/1) ... [2024-11-08 23:03:57,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:03:57,703 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-83.i[917,930] [2024-11-08 23:03:57,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:03:57,743 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:03:57,755 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-83.i[917,930] [2024-11-08 23:03:57,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:03:57,788 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:03:57,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:57 WrapperNode [2024-11-08 23:03:57,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:03:57,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:03:57,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:03:57,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:03:57,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:57" (1/1) ... [2024-11-08 23:03:57,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:57" (1/1) ... [2024-11-08 23:03:57,861 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-11-08 23:03:57,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:03:57,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:03:57,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:03:57,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:03:57,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:57" (1/1) ... [2024-11-08 23:03:57,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:57" (1/1) ... [2024-11-08 23:03:57,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:57" (1/1) ... [2024-11-08 23:03:57,942 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-08 23:03:57,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:57" (1/1) ... [2024-11-08 23:03:57,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:57" (1/1) ... [2024-11-08 23:03:57,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:57" (1/1) ... [2024-11-08 23:03:57,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:57" (1/1) ... [2024-11-08 23:03:57,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:57" (1/1) ... [2024-11-08 23:03:57,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:57" (1/1) ... [2024-11-08 23:03:57,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:03:57,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:03:57,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:03:57,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:03:57,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:57" (1/1) ... [2024-11-08 23:03:57,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:03:57,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:03:58,004 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-08 23:03:58,018 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-08 23:03:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:03:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:03:58,049 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:03:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:03:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:03:58,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:03:58,106 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:03:58,108 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:03:58,321 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 23:03:58,321 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:03:58,338 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:03:58,342 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:03:58,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:03:58 BoogieIcfgContainer [2024-11-08 23:03:58,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:03:58,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:03:58,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:03:58,347 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:03:58,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:03:57" (1/3) ... [2024-11-08 23:03:58,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671bb14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:03:58, skipping insertion in model container [2024-11-08 23:03:58,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:57" (2/3) ... [2024-11-08 23:03:58,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671bb14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:03:58, skipping insertion in model container [2024-11-08 23:03:58,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:03:58" (3/3) ... [2024-11-08 23:03:58,350 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-83.i [2024-11-08 23:03:58,363 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:03:58,363 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:03:58,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:03:58,438 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;@57e56f48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:03:58,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:03:58,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 23:03:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 23:03:58,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:03:58,452 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:03:58,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:03:58,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:03:58,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2107287054, now seen corresponding path program 1 times [2024-11-08 23:03:58,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:03:58,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176424435] [2024-11-08 23:03:58,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:03:58,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:58,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:03:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:58,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:03:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:58,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:03:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:58,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:03:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:58,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:03:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:58,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:03:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:58,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:03:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:58,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:03:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:58,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:03:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:58,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:03:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:58,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:03:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:03:58,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:03:58,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176424435] [2024-11-08 23:03:58,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176424435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:03:58,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:03:58,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:03:58,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664937683] [2024-11-08 23:03:58,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:03:58,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:03:58,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:03:58,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:03:58,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:03:58,769 INFO L87 Difference]: Start difference. First operand has 56 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-08 23:03:58,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:03:58,792 INFO L93 Difference]: Finished difference Result 105 states and 169 transitions. [2024-11-08 23:03:58,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:03:58,794 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 78 [2024-11-08 23:03:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:03:58,803 INFO L225 Difference]: With dead ends: 105 [2024-11-08 23:03:58,804 INFO L226 Difference]: Without dead ends: 52 [2024-11-08 23:03:58,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-08 23:03:58,810 INFO L432 NwaCegarLoop]: 74 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, 74 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-08 23:03:58,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:03:58,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-08 23:03:58,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-08 23:03:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 23:03:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-11-08 23:03:58,852 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 78 [2024-11-08 23:03:58,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:03:58,853 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-11-08 23:03:58,854 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-08 23:03:58,854 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-11-08 23:03:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 23:03:58,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:03:58,859 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:03:58,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:03:58,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:03:58,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:03:58,863 INFO L85 PathProgramCache]: Analyzing trace with hash -580827272, now seen corresponding path program 1 times [2024-11-08 23:03:58,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:03:58,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007530741] [2024-11-08 23:03:58,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:03:58,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:03:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:03:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:03:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:03:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:03:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:03:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:03:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:03:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:03:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:03:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:03:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:03:59,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:03:59,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007530741] [2024-11-08 23:03:59,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007530741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:03:59,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:03:59,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:03:59,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006776150] [2024-11-08 23:03:59,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:03:59,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:03:59,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:03:59,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:03:59,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:03:59,098 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 23:03:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:03:59,131 INFO L93 Difference]: Finished difference Result 124 states and 178 transitions. [2024-11-08 23:03:59,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:03:59,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 78 [2024-11-08 23:03:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:03:59,136 INFO L225 Difference]: With dead ends: 124 [2024-11-08 23:03:59,136 INFO L226 Difference]: Without dead ends: 75 [2024-11-08 23:03:59,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:03:59,137 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 66 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:03:59,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 128 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:03:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-08 23:03:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2024-11-08 23:03:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 23:03:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2024-11-08 23:03:59,145 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 78 [2024-11-08 23:03:59,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:03:59,147 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2024-11-08 23:03:59,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 23:03:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2024-11-08 23:03:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 23:03:59,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:03:59,151 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:03:59,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:03:59,151 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:03:59,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:03:59,151 INFO L85 PathProgramCache]: Analyzing trace with hash 39834531, now seen corresponding path program 1 times [2024-11-08 23:03:59,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:03:59,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865809018] [2024-11-08 23:03:59,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:03:59,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:03:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:03:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:03:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:03:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:03:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:03:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:03:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:03:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:03:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:03:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:03:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:03:59,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:03:59,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865809018] [2024-11-08 23:03:59,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865809018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:03:59,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:03:59,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:03:59,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955705174] [2024-11-08 23:03:59,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:03:59,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:03:59,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:03:59,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:03:59,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:03:59,309 INFO L87 Difference]: Start difference. First operand 52 states and 72 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 23:03:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:03:59,374 INFO L93 Difference]: Finished difference Result 103 states and 144 transitions. [2024-11-08 23:03:59,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:03:59,374 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 79 [2024-11-08 23:03:59,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:03:59,375 INFO L225 Difference]: With dead ends: 103 [2024-11-08 23:03:59,377 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 23:03:59,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:03:59,378 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 7 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:03:59,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 181 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:03:59,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 23:03:59,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-08 23:03:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 23:03:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2024-11-08 23:03:59,389 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 79 [2024-11-08 23:03:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:03:59,391 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2024-11-08 23:03:59,391 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 23:03:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2024-11-08 23:03:59,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 23:03:59,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:03:59,393 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:03:59,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:03:59,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:03:59,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:03:59,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1817231564, now seen corresponding path program 1 times [2024-11-08 23:03:59,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:03:59,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001090005] [2024-11-08 23:03:59,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:03:59,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:01,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:04:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:01,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:04:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:01,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:04:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:01,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:04:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:01,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:04:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:01,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:04:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:01,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:04:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:01,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:04:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:01,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:04:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:01,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:04:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:01,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:04:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:04:01,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:04:01,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001090005] [2024-11-08 23:04:01,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001090005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:04:01,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:04:01,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:04:01,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244647800] [2024-11-08 23:04:01,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:04:01,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:04:01,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:04:01,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:04:01,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:04:01,052 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 23:04:01,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:04:01,398 INFO L93 Difference]: Finished difference Result 136 states and 183 transitions. [2024-11-08 23:04:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:04:01,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 80 [2024-11-08 23:04:01,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:04:01,401 INFO L225 Difference]: With dead ends: 136 [2024-11-08 23:04:01,402 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 23:04:01,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:04:01,403 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 96 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:04:01,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 158 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:04:01,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 23:04:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2024-11-08 23:04:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 23:04:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-08 23:04:01,417 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 80 [2024-11-08 23:04:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:04:01,418 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-08 23:04:01,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 23:04:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-08 23:04:01,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 23:04:01,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:04:01,419 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:04:01,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:04:01,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:04:01,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:04:01,420 INFO L85 PathProgramCache]: Analyzing trace with hash -797720763, now seen corresponding path program 1 times [2024-11-08 23:04:01,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:04:01,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483959197] [2024-11-08 23:04:01,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:04:01,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:02,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:04:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:02,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:04:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:02,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:04:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:02,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:04:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:02,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:04:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:02,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:04:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:02,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:04:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:02,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:04:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:02,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:04:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:02,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:04:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:02,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:04:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:04:02,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:04:02,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483959197] [2024-11-08 23:04:02,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483959197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:04:02,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:04:02,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:04:02,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475821974] [2024-11-08 23:04:02,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:04:02,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:04:02,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:04:02,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:04:02,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:04:02,187 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 23:04:02,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:04:02,497 INFO L93 Difference]: Finished difference Result 166 states and 220 transitions. [2024-11-08 23:04:02,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:04:02,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 81 [2024-11-08 23:04:02,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:04:02,499 INFO L225 Difference]: With dead ends: 166 [2024-11-08 23:04:02,499 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 23:04:02,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:04:02,504 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 38 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:04:02,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 276 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:04:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 23:04:02,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 71. [2024-11-08 23:04:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 23:04:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-08 23:04:02,516 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 81 [2024-11-08 23:04:02,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:04:02,517 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-08 23:04:02,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 23:04:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-08 23:04:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 23:04:02,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:04:02,519 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:04:02,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:04:02,519 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:04:02,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:04:02,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1808838013, now seen corresponding path program 1 times [2024-11-08 23:04:02,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:04:02,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18575164] [2024-11-08 23:04:02,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:04:02,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:03,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:04:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:03,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:04:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:03,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:04:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:03,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:04:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:03,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:04:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:03,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:04:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:03,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:04:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:03,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:04:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:03,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:04:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:03,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:04:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:03,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:04:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:04:03,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:04:03,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18575164] [2024-11-08 23:04:03,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18575164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:04:03,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:04:03,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:04:03,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749848106] [2024-11-08 23:04:03,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:04:03,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:04:03,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:04:03,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:04:03,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:04:03,783 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 23:04:04,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:04:04,552 INFO L93 Difference]: Finished difference Result 165 states and 218 transitions. [2024-11-08 23:04:04,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:04:04,552 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 81 [2024-11-08 23:04:04,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:04:04,553 INFO L225 Difference]: With dead ends: 165 [2024-11-08 23:04:04,554 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 23:04:04,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:04:04,555 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 70 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:04:04,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 305 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 23:04:04,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 23:04:04,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 58. [2024-11-08 23:04:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 23:04:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2024-11-08 23:04:04,565 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 81 [2024-11-08 23:04:04,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:04:04,565 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2024-11-08 23:04:04,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 23:04:04,565 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2024-11-08 23:04:04,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 23:04:04,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:04:04,566 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:04:04,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:04:04,569 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:04:04,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:04:04,570 INFO L85 PathProgramCache]: Analyzing trace with hash -973072421, now seen corresponding path program 1 times [2024-11-08 23:04:04,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:04:04,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595894814] [2024-11-08 23:04:04,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:04:04,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:04:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:04:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:04:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:04:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:04:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:04:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:04:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:04:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:04:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:04:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:04:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:04:04,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:04:04,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595894814] [2024-11-08 23:04:04,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595894814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:04:04,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:04:04,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:04:04,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359389171] [2024-11-08 23:04:04,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:04:04,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:04:04,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:04:04,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:04:04,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:04:04,647 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 23:04:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:04:04,684 INFO L93 Difference]: Finished difference Result 134 states and 173 transitions. [2024-11-08 23:04:04,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:04:04,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 82 [2024-11-08 23:04:04,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:04:04,685 INFO L225 Difference]: With dead ends: 134 [2024-11-08 23:04:04,685 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 23:04:04,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:04:04,686 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:04:04,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 105 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:04:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 23:04:04,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2024-11-08 23:04:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 23:04:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2024-11-08 23:04:04,692 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 82 [2024-11-08 23:04:04,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:04:04,692 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2024-11-08 23:04:04,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 23:04:04,693 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2024-11-08 23:04:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 23:04:04,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:04:04,693 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:04:04,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 23:04:04,694 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:04:04,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:04:04,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2091972774, now seen corresponding path program 1 times [2024-11-08 23:04:04,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:04:04,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242315367] [2024-11-08 23:04:04,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:04:04,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:04:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:04:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:04:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:04:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:04:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:04:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:04:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:04:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:04:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:04:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:04:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 23:04:04,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:04:04,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242315367] [2024-11-08 23:04:04,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242315367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:04:04,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:04:04,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:04:04,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947020938] [2024-11-08 23:04:04,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:04:04,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:04:04,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:04:04,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:04:04,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:04:04,756 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-08 23:04:04,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:04:04,827 INFO L93 Difference]: Finished difference Result 150 states and 197 transitions. [2024-11-08 23:04:04,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:04:04,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 82 [2024-11-08 23:04:04,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:04:04,828 INFO L225 Difference]: With dead ends: 150 [2024-11-08 23:04:04,828 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 23:04:04,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:04:04,829 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 104 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:04:04,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 108 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:04:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 23:04:04,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2024-11-08 23:04:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 23:04:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-11-08 23:04:04,842 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 82 [2024-11-08 23:04:04,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:04:04,842 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-11-08 23:04:04,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-08 23:04:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-11-08 23:04:04,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 23:04:04,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:04:04,844 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:04:04,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 23:04:04,844 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:04:04,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:04:04,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1881773735, now seen corresponding path program 1 times [2024-11-08 23:04:04,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:04:04,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197658160] [2024-11-08 23:04:04,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:04:04,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:04:04,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864223766] [2024-11-08 23:04:04,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:04:04,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:04:04,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:04:04,885 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-08 23:04:04,886 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-08 23:04:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:04:04,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:04:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:04:05,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:04:05,035 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:04:05,036 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:04:05,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:04:05,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:04:05,241 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:04:05,292 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:04:05,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:04:05 BoogieIcfgContainer [2024-11-08 23:04:05,294 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:04:05,295 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:04:05,295 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:04:05,295 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:04:05,295 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:03:58" (3/4) ... [2024-11-08 23:04:05,297 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:04:05,298 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:04:05,298 INFO L158 Benchmark]: Toolchain (without parser) took 7741.18ms. Allocated memory was 151.0MB in the beginning and 331.4MB in the end (delta: 180.4MB). Free memory was 80.5MB in the beginning and 129.8MB in the end (delta: -49.3MB). Peak memory consumption was 132.6MB. Max. memory is 16.1GB. [2024-11-08 23:04:05,298 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory was 100.9MB in the beginning and 100.9MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:04:05,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.05ms. Allocated memory is still 151.0MB. Free memory was 80.3MB in the beginning and 65.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:04:05,299 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.13ms. Allocated memory is still 151.0MB. Free memory was 65.4MB in the beginning and 62.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:04:05,299 INFO L158 Benchmark]: Boogie Preprocessor took 106.46ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 62.3MB in the beginning and 187.2MB in the end (delta: -125.0MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-11-08 23:04:05,299 INFO L158 Benchmark]: RCFGBuilder took 373.27ms. Allocated memory is still 218.1MB. Free memory was 187.2MB in the beginning and 167.3MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:04:05,300 INFO L158 Benchmark]: TraceAbstraction took 6949.60ms. Allocated memory was 218.1MB in the beginning and 331.4MB in the end (delta: 113.2MB). Free memory was 167.3MB in the beginning and 129.8MB in the end (delta: 37.5MB). Peak memory consumption was 151.8MB. Max. memory is 16.1GB. [2024-11-08 23:04:05,300 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 331.4MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:04:05,301 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.17ms. Allocated memory is still 151.0MB. Free memory was 100.9MB in the beginning and 100.9MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.05ms. Allocated memory is still 151.0MB. Free memory was 80.3MB in the beginning and 65.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.13ms. Allocated memory is still 151.0MB. Free memory was 65.4MB in the beginning and 62.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.46ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 62.3MB in the beginning and 187.2MB in the end (delta: -125.0MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * RCFGBuilder took 373.27ms. Allocated memory is still 218.1MB. Free memory was 187.2MB in the beginning and 167.3MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6949.60ms. Allocated memory was 218.1MB in the beginning and 331.4MB in the end (delta: 113.2MB). Free memory was 167.3MB in the beginning and 129.8MB in the end (delta: 37.5MB). Peak memory consumption was 151.8MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 331.4MB. Free memory is still 129.8MB. 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 89, overapproximation of bitwiseOr at line 52. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 25; [L25] unsigned char var_1_4 = 4; [L26] double var_1_8 = 127.625; [L27] double var_1_10 = 0.8; [L28] double var_1_11 = 128.75; [L29] double var_1_12 = 24.8; [L30] signed short int var_1_14 = -128; [L31] signed char var_1_15 = 64; [L32] signed char var_1_16 = 5; [L33] double var_1_17 = 1.5; [L34] unsigned short int last_1_var_1_1 = 128; VAL [isInitial=0, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=0, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L86] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=0, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L70] var_1_3 = __VERIFIER_nondet_ushort() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=1021/8] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=1021/8] [L72] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=4, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=4, var_1_8=1021/8] [L72] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=4, var_1_8=1021/8] [L73] var_1_4 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L75] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L75] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L76] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L76] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L77] var_1_10 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L78] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L79] var_1_11 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L80] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L81] var_1_16 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L82] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L83] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L83] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L97] RET updateVariables() [L98] CALL step() [L38] var_1_14 = 200 [L39] var_1_15 = var_1_16 [L40] var_1_17 = var_1_10 [L41] signed long int stepLocal_0 = var_1_3 / var_1_4; VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L42] COND TRUE \read(var_1_2) [L43] var_1_1 = (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L51] signed long int stepLocal_2 = var_1_3 + var_1_1; VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_2=0, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L52] EXPR var_1_14 ^ var_1_15 VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_2=0, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L52] signed long int stepLocal_1 = var_1_14 ^ var_1_15; [L53] COND FALSE !(var_1_15 <= stepLocal_2) [L60] var_1_8 = var_1_10 VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_1=1, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L62] COND FALSE !(var_1_15 > var_1_15) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_1=1, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR (var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((double) var_1_11))) : (var_1_8 == ((double) var_1_10))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L89] EXPR (var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((double) var_1_11))) : (var_1_8 == ((double) var_1_10)) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L89] EXPR (var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((double) var_1_11))) : (var_1_8 == ((double) var_1_10))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L89-L90] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((double) var_1_11))) : (var_1_8 == ((double) var_1_10)))) && ((var_1_15 > var_1_15) ? (var_1_12 == ((double) ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) : 1)) && (var_1_14 == ((signed short int) 200))) && (var_1_15 == ((signed char) var_1_16))) && (var_1_17 == ((double) var_1_10)) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 408 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 408 mSDsluCounter, 1335 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 759 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 619 IncrementalHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 576 mSDtfsCounter, 619 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=4, InterpolantAutomatonStates: 33, 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, 8 MinimizatonAttempts, 146 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 633 ConstructedInterpolants, 0 QuantifiedInterpolants, 3035 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 1760/1760 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-08 23:04:05,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-83.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 f0343b048050125a5905463af6d7877f94dec42ff05d99e3ac24dce58bdf9f5e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:04:07,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:04:07,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:04:07,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:04:07,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:04:07,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:04:07,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:04:07,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:04:07,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:04:07,312 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:04:07,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:04:07,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:04:07,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:04:07,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:04:07,313 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:04:07,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:04:07,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:04:07,315 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:04:07,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:04:07,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:04:07,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:04:07,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:04:07,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:04:07,319 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:04:07,319 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:04:07,319 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:04:07,319 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:04:07,319 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:04:07,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:04:07,319 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:04:07,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:04:07,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:04:07,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:04:07,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:04:07,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:04:07,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:04:07,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:04:07,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:04:07,321 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:04:07,323 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:04:07,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:04:07,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:04:07,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:04:07,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:04:07,324 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 -> f0343b048050125a5905463af6d7877f94dec42ff05d99e3ac24dce58bdf9f5e [2024-11-08 23:04:07,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:04:07,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:04:07,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:04:07,640 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:04:07,640 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:04:07,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-83.i [2024-11-08 23:04:08,999 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:04:09,170 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:04:09,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-83.i [2024-11-08 23:04:09,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd779ef24/a3dbe7d9607343ed984b077ad48439f0/FLAG2f2ee4a54 [2024-11-08 23:04:09,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd779ef24/a3dbe7d9607343ed984b077ad48439f0 [2024-11-08 23:04:09,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:04:09,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:04:09,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:04:09,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:04:09,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:04:09,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:04:09" (1/1) ... [2024-11-08 23:04:09,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e66e212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:09, skipping insertion in model container [2024-11-08 23:04:09,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:04:09" (1/1) ... [2024-11-08 23:04:09,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:04:09,351 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-83.i[917,930] [2024-11-08 23:04:09,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:04:09,415 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:04:09,427 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-83.i[917,930] [2024-11-08 23:04:09,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:04:09,480 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:04:09,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:09 WrapperNode [2024-11-08 23:04:09,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:04:09,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:04:09,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:04:09,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:04:09,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:09" (1/1) ... [2024-11-08 23:04:09,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:09" (1/1) ... [2024-11-08 23:04:09,528 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2024-11-08 23:04:09,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:04:09,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:04:09,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:04:09,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:04:09,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:09" (1/1) ... [2024-11-08 23:04:09,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:09" (1/1) ... [2024-11-08 23:04:09,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:09" (1/1) ... [2024-11-08 23:04:09,562 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-08 23:04:09,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:09" (1/1) ... [2024-11-08 23:04:09,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:09" (1/1) ... [2024-11-08 23:04:09,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:09" (1/1) ... [2024-11-08 23:04:09,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:09" (1/1) ... [2024-11-08 23:04:09,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:09" (1/1) ... [2024-11-08 23:04:09,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:09" (1/1) ... [2024-11-08 23:04:09,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:04:09,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:04:09,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:04:09,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:04:09,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:09" (1/1) ... [2024-11-08 23:04:09,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:04:09,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:04:09,617 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-08 23:04:09,624 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-08 23:04:09,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:04:09,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:04:09,664 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:04:09,664 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:04:09,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:04:09,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:04:09,743 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:04:09,748 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:04:10,170 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 23:04:10,170 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:04:10,187 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:04:10,187 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:04:10,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:04:10 BoogieIcfgContainer [2024-11-08 23:04:10,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:04:10,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:04:10,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:04:10,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:04:10,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:04:09" (1/3) ... [2024-11-08 23:04:10,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263abc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:04:10, skipping insertion in model container [2024-11-08 23:04:10,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:04:09" (2/3) ... [2024-11-08 23:04:10,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263abc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:04:10, skipping insertion in model container [2024-11-08 23:04:10,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:04:10" (3/3) ... [2024-11-08 23:04:10,196 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-83.i [2024-11-08 23:04:10,209 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:04:10,210 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:04:10,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:04:10,262 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;@139565d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:04:10,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:04:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 23:04:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 23:04:10,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:04:10,281 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:04:10,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:04:10,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:04:10,285 INFO L85 PathProgramCache]: Analyzing trace with hash -599153747, now seen corresponding path program 1 times [2024-11-08 23:04:10,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:04:10,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200048258] [2024-11-08 23:04:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:04:10,307 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-08 23:04:10,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:04:10,310 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-08 23:04:10,310 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-08 23:04:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:10,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:04:10,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:04:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-08 23:04:10,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:04:10,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:04:10,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200048258] [2024-11-08 23:04:10,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200048258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:04:10,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:04:10,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:04:10,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008712482] [2024-11-08 23:04:10,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:04:10,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:04:10,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:04:10,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:04:10,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:04:10,630 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-08 23:04:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:04:10,648 INFO L93 Difference]: Finished difference Result 77 states and 125 transitions. [2024-11-08 23:04:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:04:10,650 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2024-11-08 23:04:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:04:10,654 INFO L225 Difference]: With dead ends: 77 [2024-11-08 23:04:10,655 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 23:04:10,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 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-08 23:04:10,661 INFO L432 NwaCegarLoop]: 52 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, 52 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-08 23:04:10,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:04:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 23:04:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 23:04:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 23:04:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2024-11-08 23:04:10,694 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 74 [2024-11-08 23:04:10,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:04:10,695 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2024-11-08 23:04:10,695 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-08 23:04:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2024-11-08 23:04:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 23:04:10,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:04:10,699 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:04:10,706 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-08 23:04:10,899 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-08 23:04:10,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:04:10,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:04:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1898876107, now seen corresponding path program 1 times [2024-11-08 23:04:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:04:10,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601909153] [2024-11-08 23:04:10,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:04:10,903 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-08 23:04:10,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:04:10,904 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-08 23:04:10,906 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-08 23:04:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:11,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 23:04:11,101 INFO L278 TraceCheckSpWp]: Computing forward predicates...