./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-5.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 803cd42f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-5.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 3265f2d5cc9edc9a9e002ac711875773beb1ae91d83ddece24802ad3f3213fea
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m
[2024-11-22 11:52:06,971 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-22 11:52:07,046 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-22 11:52:07,050 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-22 11:52:07,050 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-22 11:52:07,080 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-22 11:52:07,081 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-22 11:52:07,082 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-22 11:52:07,082 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-22 11:52:07,082 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-22 11:52:07,083 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-22 11:52:07,084 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-22 11:52:07,084 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-22 11:52:07,086 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-22 11:52:07,087 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-22 11:52:07,087 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-22 11:52:07,087 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-22 11:52:07,088 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-22 11:52:07,088 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-22 11:52:07,088 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-22 11:52:07,089 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-22 11:52:07,089 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-22 11:52:07,090 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-22 11:52:07,090 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-22 11:52:07,090 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-22 11:52:07,091 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-22 11:52:07,091 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-22 11:52:07,095 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-22 11:52:07,096 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-22 11:52:07,096 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-22 11:52:07,096 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-22 11:52:07,096 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-22 11:52:07,097 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-22 11:52:07,097 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-22 11:52:07,097 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-22 11:52:07,097 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-22 11:52:07,098 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-22 11:52:07,098 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-22 11:52:07,098 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-22 11:52:07,098 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-22 11:52:07,098 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-22 11:52:07,099 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-22 11:52:07,100 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 -> 3265f2d5cc9edc9a9e002ac711875773beb1ae91d83ddece24802ad3f3213fea
[2024-11-22 11:52:07,376 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-22 11:52:07,402 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-22 11:52:07,406 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-22 11:52:07,407 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-22 11:52:07,408 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-22 11:52:07,409 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-5.i
[2024-11-22 11:52:08,875 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-22 11:52:09,075 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-22 11:52:09,076 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-5.i
[2024-11-22 11:52:09,086 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1495149/736da43d772b44dd82ce254ea3c3d514/FLAG25dabcaa6
[2024-11-22 11:52:09,454 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1495149/736da43d772b44dd82ce254ea3c3d514
[2024-11-22 11:52:09,456 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-22 11:52:09,457 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-22 11:52:09,459 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-22 11:52:09,459 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-22 11:52:09,465 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-22 11:52:09,465 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:52:09" (1/1) ...
[2024-11-22 11:52:09,466 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e1b2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:09, skipping insertion in model container
[2024-11-22 11:52:09,466 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:52:09" (1/1) ...
[2024-11-22 11:52:09,491 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-22 11:52:09,666 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_operatoramount_amount25_file-5.i[914,927]
[2024-11-22 11:52:09,710 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-22 11:52:09,720 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-22 11:52:09,730 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_operatoramount_amount25_file-5.i[914,927]
[2024-11-22 11:52:09,752 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-22 11:52:09,771 INFO  L204         MainTranslator]: Completed translation
[2024-11-22 11:52:09,771 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:09 WrapperNode
[2024-11-22 11:52:09,771 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-22 11:52:09,772 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-22 11:52:09,773 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-22 11:52:09,773 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-22 11:52:09,779 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:09" (1/1) ...
[2024-11-22 11:52:09,790 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:09" (1/1) ...
[2024-11-22 11:52:09,822 INFO  L138                Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101
[2024-11-22 11:52:09,822 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-22 11:52:09,823 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-22 11:52:09,823 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-22 11:52:09,823 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-22 11:52:09,834 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:09" (1/1) ...
[2024-11-22 11:52:09,835 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:09" (1/1) ...
[2024-11-22 11:52:09,841 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:09" (1/1) ...
[2024-11-22 11:52:09,869 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-22 11:52:09,870 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:09" (1/1) ...
[2024-11-22 11:52:09,870 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:09" (1/1) ...
[2024-11-22 11:52:09,880 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:09" (1/1) ...
[2024-11-22 11:52:09,884 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:09" (1/1) ...
[2024-11-22 11:52:09,886 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:09" (1/1) ...
[2024-11-22 11:52:09,888 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:09" (1/1) ...
[2024-11-22 11:52:09,890 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-22 11:52:09,891 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-22 11:52:09,891 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-22 11:52:09,892 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-22 11:52:09,892 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:09" (1/1) ...
[2024-11-22 11:52:09,900 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-22 11:52:09,913 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 11:52:09,933 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-22 11:52:09,941 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-22 11:52:09,987 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-22 11:52:09,987 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-22 11:52:09,988 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-22 11:52:09,988 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-22 11:52:09,988 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-22 11:52:09,988 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-22 11:52:10,060 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-22 11:52:10,062 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-22 11:52:10,347 INFO  L?                        ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2024-11-22 11:52:10,347 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-22 11:52:10,364 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-22 11:52:10,367 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-22 11:52:10,368 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:52:10 BoogieIcfgContainer
[2024-11-22 11:52:10,368 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-22 11:52:10,370 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-22 11:52:10,371 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-22 11:52:10,374 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-22 11:52:10,374 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:52:09" (1/3) ...
[2024-11-22 11:52:10,376 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4e9204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:52:10, skipping insertion in model container
[2024-11-22 11:52:10,376 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:09" (2/3) ...
[2024-11-22 11:52:10,377 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4e9204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:52:10, skipping insertion in model container
[2024-11-22 11:52:10,377 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:52:10" (3/3) ...
[2024-11-22 11:52:10,378 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-5.i
[2024-11-22 11:52:10,399 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-22 11:52:10,399 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-22 11:52:10,461 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-22 11:52:10,468 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;@4721a4c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-22 11:52:10,469 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-22 11:52:10,473 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 49 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14)
[2024-11-22 11:52:10,485 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-22 11:52:10,485 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 11:52:10,486 INFO  L215           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 11:52:10,486 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 11:52:10,490 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 11:52:10,491 INFO  L85        PathProgramCache]: Analyzing trace with hash -1614083282, now seen corresponding path program 1 times
[2024-11-22 11:52:10,499 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 11:52:10,499 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898812061]
[2024-11-22 11:52:10,500 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 11:52:10,500 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 11:52:10,617 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 11:52:10,767 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked.
[2024-11-22 11:52:10,767 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 11:52:10,768 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898812061]
[2024-11-22 11:52:10,768 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898812061] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 11:52:10,769 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083926435]
[2024-11-22 11:52:10,769 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 11:52:10,769 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 11:52:10,770 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 11:52:10,773 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-22 11:52:10,775 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-22 11:52:10,919 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 11:52:10,922 INFO  L255         TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-22 11:52:10,932 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 11:52:10,959 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked.
[2024-11-22 11:52:10,959 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-22 11:52:10,960 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083926435] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 11:52:10,960 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-22 11:52:10,960 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2024-11-22 11:52:10,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809123276]
[2024-11-22 11:52:10,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 11:52:10,968 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-22 11:52:10,969 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 11:52:10,990 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-22 11:52:10,991 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-22 11:52:10,993 INFO  L87              Difference]: Start difference. First operand  has 49 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand  has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14)
[2024-11-22 11:52:11,015 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 11:52:11,015 INFO  L93              Difference]: Finished difference Result 91 states and 150 transitions.
[2024-11-22 11:52:11,016 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-22 11:52:11,017 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93
[2024-11-22 11:52:11,017 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 11:52:11,023 INFO  L225             Difference]: With dead ends: 91
[2024-11-22 11:52:11,023 INFO  L226             Difference]: Without dead ends: 45
[2024-11-22 11:52:11,026 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 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-22 11:52:11,029 INFO  L432           NwaCegarLoop]: 64 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, 64 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-22 11:52:11,030 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 11:52:11,046 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2024-11-22 11:52:11,064 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45.
[2024-11-22 11:52:11,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 45 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14)
[2024-11-22 11:52:11,068 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions.
[2024-11-22 11:52:11,071 INFO  L78                 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 93
[2024-11-22 11:52:11,071 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 11:52:11,072 INFO  L471      AbstractCegarLoop]: Abstraction has 45 states and 64 transitions.
[2024-11-22 11:52:11,072 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14)
[2024-11-22 11:52:11,073 INFO  L276                IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions.
[2024-11-22 11:52:11,077 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-22 11:52:11,079 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 11:52:11,080 INFO  L215           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 11:52:11,088 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-22 11:52:11,283 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2024-11-22 11:52:11,283 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 11:52:11,284 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 11:52:11,284 INFO  L85        PathProgramCache]: Analyzing trace with hash 1475241070, now seen corresponding path program 1 times
[2024-11-22 11:52:11,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 11:52:11,285 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253456933]
[2024-11-22 11:52:11,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 11:52:11,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 11:52:11,436 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 11:52:12,827 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2024-11-22 11:52:12,828 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 11:52:12,828 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253456933]
[2024-11-22 11:52:12,828 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253456933] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 11:52:12,828 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 11:52:12,828 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-22 11:52:12,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507957149]
[2024-11-22 11:52:12,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 11:52:12,831 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-22 11:52:12,831 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 11:52:12,832 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-22 11:52:12,833 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-22 11:52:12,833 INFO  L87              Difference]: Start difference. First operand 45 states and 64 transitions. Second operand  has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2024-11-22 11:52:13,243 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 11:52:13,244 INFO  L93              Difference]: Finished difference Result 191 states and 270 transitions.
[2024-11-22 11:52:13,244 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-22 11:52:13,245 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93
[2024-11-22 11:52:13,245 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 11:52:13,247 INFO  L225             Difference]: With dead ends: 191
[2024-11-22 11:52:13,248 INFO  L226             Difference]: Without dead ends: 149
[2024-11-22 11:52:13,250 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-22 11:52:13,251 INFO  L432           NwaCegarLoop]: 86 mSDtfsCounter, 98 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-22 11:52:13,253 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 172 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-22 11:52:13,254 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 149 states.
[2024-11-22 11:52:13,282 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 73.
[2024-11-22 11:52:13,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 73 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-22 11:52:13,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions.
[2024-11-22 11:52:13,290 INFO  L78                 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 93
[2024-11-22 11:52:13,290 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 11:52:13,291 INFO  L471      AbstractCegarLoop]: Abstraction has 73 states and 103 transitions.
[2024-11-22 11:52:13,291 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2024-11-22 11:52:13,291 INFO  L276                IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions.
[2024-11-22 11:52:13,292 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-22 11:52:13,294 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 11:52:13,294 INFO  L215           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 11:52:13,294 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-22 11:52:13,294 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 11:52:13,295 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 11:52:13,296 INFO  L85        PathProgramCache]: Analyzing trace with hash 1477088112, now seen corresponding path program 1 times
[2024-11-22 11:52:13,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 11:52:13,296 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282631027]
[2024-11-22 11:52:13,296 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 11:52:13,296 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 11:52:13,371 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 11:52:18,656 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2024-11-22 11:52:18,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 11:52:18,657 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282631027]
[2024-11-22 11:52:18,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282631027] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 11:52:18,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 11:52:18,658 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-22 11:52:18,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630094096]
[2024-11-22 11:52:18,658 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 11:52:18,658 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-22 11:52:18,659 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 11:52:18,659 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-22 11:52:18,660 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-11-22 11:52:18,660 INFO  L87              Difference]: Start difference. First operand 73 states and 103 transitions. Second operand  has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2024-11-22 11:52:19,251 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 11:52:19,251 INFO  L93              Difference]: Finished difference Result 154 states and 213 transitions.
[2024-11-22 11:52:19,252 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-22 11:52:19,252 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93
[2024-11-22 11:52:19,253 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 11:52:19,258 INFO  L225             Difference]: With dead ends: 154
[2024-11-22 11:52:19,258 INFO  L226             Difference]: Without dead ends: 152
[2024-11-22 11:52:19,259 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210
[2024-11-22 11:52:19,260 INFO  L432           NwaCegarLoop]: 55 mSDtfsCounter, 102 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-22 11:52:19,261 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 252 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-22 11:52:19,263 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 152 states.
[2024-11-22 11:52:19,296 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 144.
[2024-11-22 11:52:19,297 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 144 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 93 states have internal predecessors, (107), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48)
[2024-11-22 11:52:19,298 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 203 transitions.
[2024-11-22 11:52:19,299 INFO  L78                 Accepts]: Start accepts. Automaton has 144 states and 203 transitions. Word has length 93
[2024-11-22 11:52:19,299 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 11:52:19,299 INFO  L471      AbstractCegarLoop]: Abstraction has 144 states and 203 transitions.
[2024-11-22 11:52:19,300 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2024-11-22 11:52:19,300 INFO  L276                IsEmpty]: Start isEmpty. Operand 144 states and 203 transitions.
[2024-11-22 11:52:19,301 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-22 11:52:19,301 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 11:52:19,302 INFO  L215           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 11:52:19,302 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-22 11:52:19,302 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 11:52:19,302 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 11:52:19,303 INFO  L85        PathProgramCache]: Analyzing trace with hash -1042871822, now seen corresponding path program 1 times
[2024-11-22 11:52:19,303 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 11:52:19,303 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662187995]
[2024-11-22 11:52:19,303 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 11:52:19,303 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 11:52:19,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 11:52:19,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2024-11-22 11:52:19,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 11:52:19,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662187995]
[2024-11-22 11:52:19,372 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662187995] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 11:52:19,372 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 11:52:19,372 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-22 11:52:19,372 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353421857]
[2024-11-22 11:52:19,372 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 11:52:19,373 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-22 11:52:19,373 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 11:52:19,377 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-22 11:52:19,377 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-22 11:52:19,377 INFO  L87              Difference]: Start difference. First operand 144 states and 203 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2024-11-22 11:52:19,409 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 11:52:19,410 INFO  L93              Difference]: Finished difference Result 280 states and 397 transitions.
[2024-11-22 11:52:19,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-22 11:52:19,411 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93
[2024-11-22 11:52:19,412 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 11:52:19,413 INFO  L225             Difference]: With dead ends: 280
[2024-11-22 11:52:19,414 INFO  L226             Difference]: Without dead ends: 139
[2024-11-22 11:52:19,417 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 11:52:19,418 INFO  L432           NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 11:52:19,418 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 11:52:19,419 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2024-11-22 11:52:19,449 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139.
[2024-11-22 11:52:19,449 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 139 states, 86 states have (on average 1.127906976744186) internal successors, (97), 88 states have internal predecessors, (97), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48)
[2024-11-22 11:52:19,452 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 193 transitions.
[2024-11-22 11:52:19,453 INFO  L78                 Accepts]: Start accepts. Automaton has 139 states and 193 transitions. Word has length 93
[2024-11-22 11:52:19,454 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 11:52:19,454 INFO  L471      AbstractCegarLoop]: Abstraction has 139 states and 193 transitions.
[2024-11-22 11:52:19,454 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2024-11-22 11:52:19,454 INFO  L276                IsEmpty]: Start isEmpty. Operand 139 states and 193 transitions.
[2024-11-22 11:52:19,457 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-22 11:52:19,457 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 11:52:19,457 INFO  L215           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 11:52:19,457 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-22 11:52:19,458 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 11:52:19,459 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 11:52:19,459 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139667856, now seen corresponding path program 1 times
[2024-11-22 11:52:19,460 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 11:52:19,460 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403827520]
[2024-11-22 11:52:19,460 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 11:52:19,460 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 11:52:19,480 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 11:52:19,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2024-11-22 11:52:19,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 11:52:19,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403827520]
[2024-11-22 11:52:19,522 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403827520] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 11:52:19,522 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 11:52:19,523 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-22 11:52:19,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162788821]
[2024-11-22 11:52:19,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 11:52:19,525 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-22 11:52:19,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 11:52:19,526 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-22 11:52:19,527 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-22 11:52:19,527 INFO  L87              Difference]: Start difference. First operand 139 states and 193 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2024-11-22 11:52:19,557 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 11:52:19,558 INFO  L93              Difference]: Finished difference Result 243 states and 337 transitions.
[2024-11-22 11:52:19,559 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-22 11:52:19,559 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93
[2024-11-22 11:52:19,560 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 11:52:19,561 INFO  L225             Difference]: With dead ends: 243
[2024-11-22 11:52:19,561 INFO  L226             Difference]: Without dead ends: 107
[2024-11-22 11:52:19,562 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 11:52:19,562 INFO  L432           NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 11:52:19,563 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 11:52:19,566 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2024-11-22 11:52:19,584 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107.
[2024-11-22 11:52:19,586 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 107 states, 64 states have (on average 1.078125) internal successors, (69), 65 states have internal predecessors, (69), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38)
[2024-11-22 11:52:19,588 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 145 transitions.
[2024-11-22 11:52:19,588 INFO  L78                 Accepts]: Start accepts. Automaton has 107 states and 145 transitions. Word has length 93
[2024-11-22 11:52:19,588 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 11:52:19,589 INFO  L471      AbstractCegarLoop]: Abstraction has 107 states and 145 transitions.
[2024-11-22 11:52:19,589 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2024-11-22 11:52:19,589 INFO  L276                IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions.
[2024-11-22 11:52:19,590 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2024-11-22 11:52:19,593 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 11:52:19,594 INFO  L215           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 11:52:19,594 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-22 11:52:19,594 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 11:52:19,594 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 11:52:19,594 INFO  L85        PathProgramCache]: Analyzing trace with hash 323580047, now seen corresponding path program 1 times
[2024-11-22 11:52:19,595 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 11:52:19,595 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625606476]
[2024-11-22 11:52:19,595 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 11:52:19,595 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 11:52:19,643 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 11:52:23,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2024-11-22 11:52:23,339 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 11:52:23,339 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625606476]
[2024-11-22 11:52:23,340 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625606476] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 11:52:23,340 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 11:52:23,340 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-22 11:52:23,340 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000793737]
[2024-11-22 11:52:23,340 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 11:52:23,341 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-22 11:52:23,341 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 11:52:23,342 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-22 11:52:23,342 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-11-22 11:52:23,342 INFO  L87              Difference]: Start difference. First operand 107 states and 145 transitions. Second operand  has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2024-11-22 11:52:23,623 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 11:52:23,624 INFO  L93              Difference]: Finished difference Result 127 states and 165 transitions.
[2024-11-22 11:52:23,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-22 11:52:23,625 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94
[2024-11-22 11:52:23,625 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 11:52:23,626 INFO  L225             Difference]: With dead ends: 127
[2024-11-22 11:52:23,626 INFO  L226             Difference]: Without dead ends: 125
[2024-11-22 11:52:23,627 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2024-11-22 11:52:23,627 INFO  L432           NwaCegarLoop]: 61 mSDtfsCounter, 13 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-22 11:52:23,628 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 374 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-22 11:52:23,628 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 125 states.
[2024-11-22 11:52:23,647 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116.
[2024-11-22 11:52:23,648 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 116 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 74 states have internal predecessors, (78), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38)
[2024-11-22 11:52:23,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions.
[2024-11-22 11:52:23,650 INFO  L78                 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 94
[2024-11-22 11:52:23,650 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 11:52:23,650 INFO  L471      AbstractCegarLoop]: Abstraction has 116 states and 154 transitions.
[2024-11-22 11:52:23,650 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2024-11-22 11:52:23,651 INFO  L276                IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions.
[2024-11-22 11:52:23,652 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2024-11-22 11:52:23,652 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 11:52:23,652 INFO  L215           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 11:52:23,652 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-22 11:52:23,652 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 11:52:23,653 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 11:52:23,653 INFO  L85        PathProgramCache]: Analyzing trace with hash 93886917, now seen corresponding path program 1 times
[2024-11-22 11:52:23,653 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 11:52:23,653 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529450060]
[2024-11-22 11:52:23,653 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 11:52:23,654 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 11:52:23,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 11:52:24,493 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2024-11-22 11:52:24,494 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 11:52:24,494 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529450060]
[2024-11-22 11:52:24,495 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529450060] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 11:52:24,496 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 11:52:24,496 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-22 11:52:24,496 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598207659]
[2024-11-22 11:52:24,496 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 11:52:24,496 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-22 11:52:24,496 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 11:52:24,497 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-22 11:52:24,497 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2024-11-22 11:52:24,497 INFO  L87              Difference]: Start difference. First operand 116 states and 154 transitions. Second operand  has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2024-11-22 11:52:24,676 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 11:52:24,677 INFO  L93              Difference]: Finished difference Result 140 states and 178 transitions.
[2024-11-22 11:52:24,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-11-22 11:52:24,678 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95
[2024-11-22 11:52:24,678 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 11:52:24,679 INFO  L225             Difference]: With dead ends: 140
[2024-11-22 11:52:24,679 INFO  L226             Difference]: Without dead ends: 138
[2024-11-22 11:52:24,680 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156
[2024-11-22 11:52:24,680 INFO  L432           NwaCegarLoop]: 72 mSDtfsCounter, 22 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 11:52:24,681 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 403 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 11:52:24,681 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2024-11-22 11:52:24,697 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116.
[2024-11-22 11:52:24,698 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 116 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 74 states have internal predecessors, (78), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38)
[2024-11-22 11:52:24,699 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions.
[2024-11-22 11:52:24,700 INFO  L78                 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 95
[2024-11-22 11:52:24,700 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 11:52:24,700 INFO  L471      AbstractCegarLoop]: Abstraction has 116 states and 154 transitions.
[2024-11-22 11:52:24,700 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2024-11-22 11:52:24,701 INFO  L276                IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions.
[2024-11-22 11:52:24,702 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 185
[2024-11-22 11:52:24,702 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 11:52:24,703 INFO  L215           NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 11:52:24,703 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-22 11:52:24,703 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 11:52:24,703 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 11:52:24,704 INFO  L85        PathProgramCache]: Analyzing trace with hash -1313672385, now seen corresponding path program 1 times
[2024-11-22 11:52:24,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 11:52:24,704 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431746349]
[2024-11-22 11:52:24,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 11:52:24,704 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 11:52:24,761 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 11:52:26,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 1545 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1536 trivial. 0 not checked.
[2024-11-22 11:52:26,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 11:52:26,492 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431746349]
[2024-11-22 11:52:26,492 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431746349] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 11:52:26,492 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428842398]
[2024-11-22 11:52:26,492 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 11:52:26,492 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 11:52:26,493 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 11:52:26,495 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-22 11:52:26,496 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-22 11:52:26,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 11:52:26,596 INFO  L255         TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 38 conjuncts are in the unsatisfiable core
[2024-11-22 11:52:26,607 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 11:52:40,562 INFO  L134       CoverageAnalysis]: Checked inductivity of 1545 backedges. 182 proven. 537 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked.
[2024-11-22 11:52:40,563 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-22 11:52:43,175 INFO  L134       CoverageAnalysis]: Checked inductivity of 1545 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1536 trivial. 0 not checked.
[2024-11-22 11:52:43,175 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [428842398] provided 1 perfect and 1 imperfect interpolant sequences
[2024-11-22 11:52:43,175 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2024-11-22 11:52:43,175 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 17] total 29
[2024-11-22 11:52:43,176 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751237322]
[2024-11-22 11:52:43,176 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 11:52:43,176 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-22 11:52:43,176 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 11:52:43,177 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-22 11:52:43,177 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812
[2024-11-22 11:52:43,177 INFO  L87              Difference]: Start difference. First operand 116 states and 154 transitions. Second operand  has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2024-11-22 11:52:43,512 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 11:52:43,513 INFO  L93              Difference]: Finished difference Result 137 states and 176 transitions.
[2024-11-22 11:52:43,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-22 11:52:43,513 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 184
[2024-11-22 11:52:43,513 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 11:52:43,514 INFO  L225             Difference]: With dead ends: 137
[2024-11-22 11:52:43,514 INFO  L226             Difference]: Without dead ends: 0
[2024-11-22 11:52:43,514 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 353 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122
[2024-11-22 11:52:43,515 INFO  L432           NwaCegarLoop]: 68 mSDtfsCounter, 64 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 11:52:43,515 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 325 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 11:52:43,516 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-22 11:52:43,516 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-22 11:52:43,516 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-22 11:52:43,516 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-22 11:52:43,517 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 184
[2024-11-22 11:52:43,517 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 11:52:43,517 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-22 11:52:43,517 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2024-11-22 11:52:43,517 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-22 11:52:43,517 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-22 11:52:43,523 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-22 11:52:43,530 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-22 11:52:43,723 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7
[2024-11-22 11:52:43,726 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 11:52:43,728 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-22 11:52:44,453 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-22 11:52:44,475 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:52:44 BoogieIcfgContainer
[2024-11-22 11:52:44,475 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-22 11:52:44,476 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-22 11:52:44,476 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-22 11:52:44,476 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-22 11:52:44,476 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:52:10" (3/4) ...
[2024-11-22 11:52:44,480 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-22 11:52:44,484 INFO  L361     RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not
[2024-11-22 11:52:44,490 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges
[2024-11-22 11:52:44,490 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-22 11:52:44,491 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-22 11:52:44,491 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-22 11:52:44,599 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-22 11:52:44,599 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-22 11:52:44,599 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-22 11:52:44,600 INFO  L158              Benchmark]: Toolchain (without parser) took 35142.90ms. Allocated memory was 159.4MB in the beginning and 1.1GB in the end (delta: 929.0MB). Free memory was 103.7MB in the beginning and 1.0GB in the end (delta: -932.6MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-22 11:52:44,601 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-22 11:52:44,601 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 312.59ms. Allocated memory is still 159.4MB. Free memory was 103.3MB in the beginning and 88.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-11-22 11:52:44,601 INFO  L158              Benchmark]: Boogie Procedure Inliner took 49.99ms. Allocated memory is still 159.4MB. Free memory was 88.6MB in the beginning and 85.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-22 11:52:44,602 INFO  L158              Benchmark]: Boogie Preprocessor took 67.45ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 81.1MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-22 11:52:44,602 INFO  L158              Benchmark]: RCFGBuilder took 476.62ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 81.1MB in the beginning and 177.2MB in the end (delta: -96.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB.
[2024-11-22 11:52:44,602 INFO  L158              Benchmark]: TraceAbstraction took 34104.94ms. Allocated memory was 209.7MB in the beginning and 1.1GB in the end (delta: 878.7MB). Free memory was 177.2MB in the beginning and 1.0GB in the end (delta: -865.4MB). Peak memory consumption was 651.9MB. Max. memory is 16.1GB.
[2024-11-22 11:52:44,603 INFO  L158              Benchmark]: Witness Printer took 123.64ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-22 11:52:44,604 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.18ms. Allocated memory is still 159.4MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 312.59ms. Allocated memory is still 159.4MB. Free memory was 103.3MB in the beginning and 88.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 49.99ms. Allocated memory is still 159.4MB. Free memory was 88.6MB in the beginning and 85.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 67.45ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 81.1MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 476.62ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 81.1MB in the beginning and 177.2MB in the end (delta: -96.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB.
 * TraceAbstraction took 34104.94ms. Allocated memory was 209.7MB in the beginning and 1.1GB in the end (delta: 878.7MB). Free memory was 177.2MB in the beginning and 1.0GB in the end (delta: -865.4MB). Peak memory consumption was 651.9MB. Max. memory is 16.1GB.
 * Witness Printer took 123.64ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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
  - PositiveResult [Line: 19]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.3s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 299 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 299 mSDsluCounter, 1828 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1300 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 753 IncrementalHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 528 mSDtfsCounter, 753 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 468 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=3, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 115 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 29.8s InterpolantComputationTime, 1115 NumberOfCodeBlocks, 1115 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1288 ConstructedInterpolants, 0 QuantifiedInterpolants, 5050 SizeOfPredicates, 29 NumberOfNonLiveVariables, 608 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 6977/7547 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
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 95]: Loop Invariant
    Derived loop invariant: ((((var_1_8 == var_1_15) && (var_1_12 <= var_1_8)) || ((((var_1_13 <= (var_1_13 + 10)) && (var_1_9 <= 0)) && (var_1_13 <= (245 + var_1_13))) && (var_1_8 == 10))) || (((var_1_8 + 1) <= var_1_12) && (var_1_15 == var_1_12)))
  - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not
    Derived contract for procedure assume_abort_if_not. Ensures: (((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (last_1_var_1_8 == \old(last_1_var_1_8)))
RESULT: Ultimate proved your program to be correct!
[2024-11-22 11:52:44,637 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE