./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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-30.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 a96ac352045787eafd1dd759ea6f3eca6a30526272b8b586e505a22e035c217a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:40:50,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:40:50,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:40:50,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:40:50,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:40:50,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:40:50,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:40:50,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:40:50,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:40:50,493 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:40:50,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:40:50,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:40:50,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:40:50,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:40:50,497 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:40:50,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:40:50,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:40:50,498 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:40:50,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:40:50,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:40:50,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:40:50,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:40:50,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:40:50,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:40:50,504 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:40:50,504 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:40:50,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:40:50,505 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:40:50,505 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:40:50,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:40:50,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:40:50,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:40:50,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:40:50,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:40:50,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:40:50,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:40:50,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:40:50,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:40:50,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:40:50,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:40:50,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:40:50,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:40:50,511 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 -> a96ac352045787eafd1dd759ea6f3eca6a30526272b8b586e505a22e035c217a [2024-11-10 06:40:50,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:40:50,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:40:50,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:40:50,833 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:40:50,833 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:40:50,835 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-30.i [2024-11-10 06:40:52,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:40:52,634 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:40:52,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-30.i [2024-11-10 06:40:52,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96e5dd479/39c1a0e9e2e147e0ab3774b05499547c/FLAGfd38cc039 [2024-11-10 06:40:52,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96e5dd479/39c1a0e9e2e147e0ab3774b05499547c [2024-11-10 06:40:52,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:40:52,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:40:53,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:40:53,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:40:53,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:40:53,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:40:52" (1/1) ... [2024-11-10 06:40:53,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794e7ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:40:53, skipping insertion in model container [2024-11-10 06:40:53,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:40:52" (1/1) ... [2024-11-10 06:40:53,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:40:53,203 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-30.i[917,930] [2024-11-10 06:40:53,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:40:53,268 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:40:53,283 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-30.i[917,930] [2024-11-10 06:40:53,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:40:53,328 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:40:53,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:40:53 WrapperNode [2024-11-10 06:40:53,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:40:53,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:40:53,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:40:53,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:40:53,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:40:53" (1/1) ... [2024-11-10 06:40:53,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:40:53" (1/1) ... [2024-11-10 06:40:53,390 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2024-11-10 06:40:53,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:40:53,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:40:53,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:40:53,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:40:53,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:40:53" (1/1) ... [2024-11-10 06:40:53,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:40:53" (1/1) ... [2024-11-10 06:40:53,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:40:53" (1/1) ... [2024-11-10 06:40:53,436 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-10 06:40:53,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:40:53" (1/1) ... [2024-11-10 06:40:53,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:40:53" (1/1) ... [2024-11-10 06:40:53,445 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:40:53" (1/1) ... [2024-11-10 06:40:53,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:40:53" (1/1) ... [2024-11-10 06:40:53,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:40:53" (1/1) ... [2024-11-10 06:40:53,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:40:53" (1/1) ... [2024-11-10 06:40:53,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:40:53,455 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:40:53,455 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:40:53,455 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:40:53,456 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:40:53" (1/1) ... [2024-11-10 06:40:53,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:40:53,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:40:53,500 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-10 06:40:53,507 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-10 06:40:53,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:40:53,555 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:40:53,556 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:40:53,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:40:53,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:40:53,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:40:53,651 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:40:53,654 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:40:54,090 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;havoc property_#t~short16#1; [2024-11-10 06:40:54,124 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-10 06:40:54,124 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:40:54,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:40:54,154 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:40:54,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:40:54 BoogieIcfgContainer [2024-11-10 06:40:54,155 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:40:54,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:40:54,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:40:54,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:40:54,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:40:52" (1/3) ... [2024-11-10 06:40:54,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1b2a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:40:54, skipping insertion in model container [2024-11-10 06:40:54,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:40:53" (2/3) ... [2024-11-10 06:40:54,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1b2a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:40:54, skipping insertion in model container [2024-11-10 06:40:54,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:40:54" (3/3) ... [2024-11-10 06:40:54,168 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-30.i [2024-11-10 06:40:54,187 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:40:54,188 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:40:54,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:40:54,271 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;@39f449a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:40:54,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:40:54,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 06:40:54,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 06:40:54,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:40:54,287 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:40:54,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:40:54,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:40:54,293 INFO L85 PathProgramCache]: Analyzing trace with hash -264108319, now seen corresponding path program 1 times [2024-11-10 06:40:54,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:40:54,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797584255] [2024-11-10 06:40:54,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:40:54,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:40:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:40:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:40:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:40:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:40:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:40:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:40:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:40:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 06:40:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:40:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 06:40:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:40:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 06:40:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:40:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 06:40:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 06:40:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:40:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:40:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 06:40:54,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:40:54,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797584255] [2024-11-10 06:40:54,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797584255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:40:54,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:40:54,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:40:54,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513162113] [2024-11-10 06:40:54,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:40:54,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:40:54,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:40:54,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:40:54,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:40:54,750 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 06:40:54,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:40:54,780 INFO L93 Difference]: Finished difference Result 128 states and 206 transitions. [2024-11-10 06:40:54,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:40:54,783 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2024-11-10 06:40:54,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:40:54,791 INFO L225 Difference]: With dead ends: 128 [2024-11-10 06:40:54,791 INFO L226 Difference]: Without dead ends: 63 [2024-11-10 06:40:54,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-10 06:40:54,798 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:40:54,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:40:54,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-10 06:40:54,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-10 06:40:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 06:40:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2024-11-10 06:40:54,845 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 115 [2024-11-10 06:40:54,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:40:54,846 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2024-11-10 06:40:54,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 06:40:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2024-11-10 06:40:54,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 06:40:54,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:40:54,849 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:40:54,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:40:54,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:40:54,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:40:54,851 INFO L85 PathProgramCache]: Analyzing trace with hash 126302818, now seen corresponding path program 1 times [2024-11-10 06:40:54,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:40:54,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040751674] [2024-11-10 06:40:54,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:40:54,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:40:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:40:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:40:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:40:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:40:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:40:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:40:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:40:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 06:40:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:40:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 06:40:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:40:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 06:40:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:40:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 06:40:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 06:40:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:40:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:40:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 06:40:56,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:40:56,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040751674] [2024-11-10 06:40:56,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040751674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:40:56,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:40:56,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 06:40:56,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607985374] [2024-11-10 06:40:56,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:40:56,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 06:40:56,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:40:56,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 06:40:56,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:40:56,280 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 06:40:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:40:56,597 INFO L93 Difference]: Finished difference Result 171 states and 238 transitions. [2024-11-10 06:40:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 06:40:56,600 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 115 [2024-11-10 06:40:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:40:56,602 INFO L225 Difference]: With dead ends: 171 [2024-11-10 06:40:56,602 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 06:40:56,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:40:56,605 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 64 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:40:56,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 451 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:40:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 06:40:56,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 76. [2024-11-10 06:40:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 06:40:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 107 transitions. [2024-11-10 06:40:56,628 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 107 transitions. Word has length 115 [2024-11-10 06:40:56,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:40:56,632 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 107 transitions. [2024-11-10 06:40:56,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 06:40:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 107 transitions. [2024-11-10 06:40:56,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 06:40:56,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:40:56,634 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:40:56,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:40:56,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:40:56,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:40:56,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1646954500, now seen corresponding path program 1 times [2024-11-10 06:40:56,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:40:56,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822644744] [2024-11-10 06:40:56,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:40:56,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:40:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:40:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:40:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:40:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:40:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:40:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:40:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:40:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 06:40:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:40:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 06:40:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:40:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 06:40:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:40:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 06:40:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 06:40:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:40:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:40:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:40:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 06:40:57,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:40:57,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822644744] [2024-11-10 06:40:57,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822644744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:40:57,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:40:57,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 06:40:57,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572972478] [2024-11-10 06:40:57,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:40:57,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 06:40:57,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:40:57,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 06:40:57,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:40:57,540 INFO L87 Difference]: Start difference. First operand 76 states and 107 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 06:40:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:40:57,817 INFO L93 Difference]: Finished difference Result 184 states and 252 transitions. [2024-11-10 06:40:57,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 06:40:57,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 116 [2024-11-10 06:40:57,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:40:57,820 INFO L225 Difference]: With dead ends: 184 [2024-11-10 06:40:57,820 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 06:40:57,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-10 06:40:57,822 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 70 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:40:57,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 420 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:40:57,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 06:40:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 85. [2024-11-10 06:40:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 states have internal predecessors, (85), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 06:40:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 119 transitions. [2024-11-10 06:40:57,842 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 119 transitions. Word has length 116 [2024-11-10 06:40:57,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:40:57,843 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 119 transitions. [2024-11-10 06:40:57,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 06:40:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 119 transitions. [2024-11-10 06:40:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 06:40:57,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:40:57,848 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:40:57,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:40:57,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:40:57,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:40:57,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1742301507, now seen corresponding path program 1 times [2024-11-10 06:40:57,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:40:57,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846559058] [2024-11-10 06:40:57,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:40:57,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:40:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat