./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label46.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version fca748b1
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label46.c -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 14408b329878540946fe7764dd35bdde7ddb2280d1dd9f9e09220bf70c4bb1b5
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m
[2024-11-19 17:18:36,511 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-19 17:18:36,573 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-19 17:18:36,579 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-19 17:18:36,580 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-19 17:18:36,608 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-19 17:18:36,608 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-19 17:18:36,608 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-19 17:18:36,609 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-19 17:18:36,609 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-19 17:18:36,609 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-19 17:18:36,610 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-19 17:18:36,611 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-19 17:18:36,612 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-19 17:18:36,612 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-19 17:18:36,612 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-19 17:18:36,612 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-19 17:18:36,613 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-19 17:18:36,613 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-19 17:18:36,613 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-19 17:18:36,614 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-19 17:18:36,617 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-19 17:18:36,618 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-19 17:18:36,618 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-19 17:18:36,618 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-19 17:18:36,618 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-19 17:18:36,618 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-19 17:18:36,619 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-19 17:18:36,619 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-19 17:18:36,619 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-19 17:18:36,619 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-19 17:18:36,620 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-19 17:18:36,620 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 17:18:36,620 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-19 17:18:36,620 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-19 17:18:36,621 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-19 17:18:36,621 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-19 17:18:36,625 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-19 17:18:36,625 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-19 17:18:36,626 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-19 17:18:36,626 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-19 17:18:36,626 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-19 17:18:36,627 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 -> 14408b329878540946fe7764dd35bdde7ddb2280d1dd9f9e09220bf70c4bb1b5
[2024-11-19 17:18:36,877 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-19 17:18:36,899 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-19 17:18:36,902 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-19 17:18:36,904 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-19 17:18:36,904 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-19 17:18:36,905 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label46.c
[2024-11-19 17:18:38,413 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-19 17:18:38,682 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-19 17:18:38,686 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label46.c
[2024-11-19 17:18:38,700 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d26aa5e83/b581ebafca7e41a79dd9befaf1f4c94b/FLAG3328f25cd
[2024-11-19 17:18:38,987 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d26aa5e83/b581ebafca7e41a79dd9befaf1f4c94b
[2024-11-19 17:18:38,990 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-19 17:18:38,991 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-19 17:18:38,993 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-19 17:18:38,994 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-19 17:18:38,998 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-19 17:18:38,999 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:18:38" (1/1) ...
[2024-11-19 17:18:39,000 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d9ffa88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:18:38, skipping insertion in model container
[2024-11-19 17:18:39,000 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:18:38" (1/1) ...
[2024-11-19 17:18:39,058 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-19 17:18:39,405 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/eca-rers2012/Problem01_label46.c[19475,19488]
[2024-11-19 17:18:39,442 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 17:18:39,459 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-19 17:18:39,547 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/eca-rers2012/Problem01_label46.c[19475,19488]
[2024-11-19 17:18:39,556 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 17:18:39,585 INFO  L204         MainTranslator]: Completed translation
[2024-11-19 17:18:39,586 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:18:39 WrapperNode
[2024-11-19 17:18:39,586 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-19 17:18:39,587 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-19 17:18:39,588 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-19 17:18:39,588 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-19 17:18:39,594 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:18:39" (1/1) ...
[2024-11-19 17:18:39,619 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:18:39" (1/1) ...
[2024-11-19 17:18:39,662 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658
[2024-11-19 17:18:39,663 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-19 17:18:39,663 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-19 17:18:39,663 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-19 17:18:39,664 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-19 17:18:39,675 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:18:39" (1/1) ...
[2024-11-19 17:18:39,675 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:18:39" (1/1) ...
[2024-11-19 17:18:39,684 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:18:39" (1/1) ...
[2024-11-19 17:18:39,721 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-19 17:18:39,725 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:18:39" (1/1) ...
[2024-11-19 17:18:39,725 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:18:39" (1/1) ...
[2024-11-19 17:18:39,754 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:18:39" (1/1) ...
[2024-11-19 17:18:39,767 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:18:39" (1/1) ...
[2024-11-19 17:18:39,772 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:18:39" (1/1) ...
[2024-11-19 17:18:39,783 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:18:39" (1/1) ...
[2024-11-19 17:18:39,798 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-19 17:18:39,799 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-19 17:18:39,799 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-19 17:18:39,799 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-19 17:18:39,800 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:18:39" (1/1) ...
[2024-11-19 17:18:39,812 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 17:18:39,823 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 17:18:39,842 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-19 17:18:39,849 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-19 17:18:39,897 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-19 17:18:39,897 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-19 17:18:39,898 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-19 17:18:39,898 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-19 17:18:39,973 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-19 17:18:39,974 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-19 17:18:40,965 INFO  L?                        ?]: Removed 75 outVars from TransFormulas that were not future-live.
[2024-11-19 17:18:40,966 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-19 17:18:40,989 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-19 17:18:40,989 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-19 17:18:40,989 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:18:40 BoogieIcfgContainer
[2024-11-19 17:18:40,990 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-19 17:18:40,991 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-19 17:18:40,992 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-19 17:18:40,996 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-19 17:18:40,996 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:18:38" (1/3) ...
[2024-11-19 17:18:40,997 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692f1cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:18:40, skipping insertion in model container
[2024-11-19 17:18:40,997 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:18:39" (2/3) ...
[2024-11-19 17:18:40,998 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692f1cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:18:40, skipping insertion in model container
[2024-11-19 17:18:40,998 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:18:40" (3/3) ...
[2024-11-19 17:18:40,999 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem01_label46.c
[2024-11-19 17:18:41,014 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-19 17:18:41,014 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-19 17:18:41,082 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-19 17:18:41,089 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;@188b32d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-19 17:18:41,089 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-19 17:18:41,095 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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-19 17:18:41,109 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2024-11-19 17:18:41,109 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:18:41,110 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:18:41,112 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:18:41,119 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:18:41,119 INFO  L85        PathProgramCache]: Analyzing trace with hash -429824977, now seen corresponding path program 1 times
[2024-11-19 17:18:41,127 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:18:41,128 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038652756]
[2024-11-19 17:18:41,129 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:18:41,129 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:18:41,350 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:18:41,677 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 17:18:41,679 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:18:41,679 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038652756]
[2024-11-19 17:18:41,680 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038652756] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:18:41,680 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:18:41,680 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 17:18:41,682 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135115173]
[2024-11-19 17:18:41,682 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:18:41,688 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 17:18:41,689 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:18:41,712 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 17:18:41,714 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 17:18:41,718 INFO  L87              Difference]: Start difference. First operand  has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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) Second operand  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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-19 17:18:42,429 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:18:42,430 INFO  L93              Difference]: Finished difference Result 528 states and 915 transitions.
[2024-11-19 17:18:42,433 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 17:18:42,434 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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) Word has length 112
[2024-11-19 17:18:42,435 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:18:42,447 INFO  L225             Difference]: With dead ends: 528
[2024-11-19 17:18:42,448 INFO  L226             Difference]: Without dead ends: 266
[2024-11-19 17:18:42,454 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-19 17:18:42,457 INFO  L432           NwaCegarLoop]: 36 mSDtfsCounter, 83 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-19 17:18:42,458 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 44 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-19 17:18:42,475 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2024-11-19 17:18:42,520 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266.
[2024-11-19 17:18:42,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 266 states, 265 states have (on average 1.4792452830188678) internal successors, (392), 265 states have internal predecessors, (392), 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-19 17:18:42,522 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 392 transitions.
[2024-11-19 17:18:42,525 INFO  L78                 Accepts]: Start accepts. Automaton has 266 states and 392 transitions. Word has length 112
[2024-11-19 17:18:42,526 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:18:42,528 INFO  L471      AbstractCegarLoop]: Abstraction has 266 states and 392 transitions.
[2024-11-19 17:18:42,528 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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-19 17:18:42,528 INFO  L276                IsEmpty]: Start isEmpty. Operand 266 states and 392 transitions.
[2024-11-19 17:18:42,532 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2024-11-19 17:18:42,532 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:18:42,533 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:18:42,534 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-19 17:18:42,535 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:18:42,535 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:18:42,536 INFO  L85        PathProgramCache]: Analyzing trace with hash -779345401, now seen corresponding path program 1 times
[2024-11-19 17:18:42,536 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:18:42,536 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139114130]
[2024-11-19 17:18:42,536 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:18:42,536 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:18:42,575 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:18:42,668 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 17:18:42,669 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:18:42,669 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139114130]
[2024-11-19 17:18:42,669 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139114130] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:18:42,669 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:18:42,670 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 17:18:42,670 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688955926]
[2024-11-19 17:18:42,670 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:18:42,671 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 17:18:42,672 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:18:42,672 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 17:18:42,673 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 17:18:42,673 INFO  L87              Difference]: Start difference. First operand 266 states and 392 transitions. Second operand  has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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-19 17:18:43,142 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:18:43,142 INFO  L93              Difference]: Finished difference Result 792 states and 1171 transitions.
[2024-11-19 17:18:43,143 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 17:18:43,143 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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) Word has length 117
[2024-11-19 17:18:43,143 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:18:43,149 INFO  L225             Difference]: With dead ends: 792
[2024-11-19 17:18:43,149 INFO  L226             Difference]: Without dead ends: 528
[2024-11-19 17:18:43,150 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-19 17:18:43,152 INFO  L432           NwaCegarLoop]: 25 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-19 17:18:43,153 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 29 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-19 17:18:43,155 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2024-11-19 17:18:43,188 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528.
[2024-11-19 17:18:43,189 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 528 states, 527 states have (on average 1.413662239089184) internal successors, (745), 527 states have internal predecessors, (745), 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-19 17:18:43,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 745 transitions.
[2024-11-19 17:18:43,191 INFO  L78                 Accepts]: Start accepts. Automaton has 528 states and 745 transitions. Word has length 117
[2024-11-19 17:18:43,191 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:18:43,192 INFO  L471      AbstractCegarLoop]: Abstraction has 528 states and 745 transitions.
[2024-11-19 17:18:43,192 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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-19 17:18:43,192 INFO  L276                IsEmpty]: Start isEmpty. Operand 528 states and 745 transitions.
[2024-11-19 17:18:43,195 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2024-11-19 17:18:43,195 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:18:43,195 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:18:43,196 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-19 17:18:43,196 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:18:43,196 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:18:43,197 INFO  L85        PathProgramCache]: Analyzing trace with hash 785225134, now seen corresponding path program 1 times
[2024-11-19 17:18:43,197 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:18:43,197 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557272111]
[2024-11-19 17:18:43,197 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:18:43,197 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:18:43,241 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:18:43,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 17:18:43,504 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:18:43,504 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557272111]
[2024-11-19 17:18:43,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557272111] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:18:43,505 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:18:43,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 17:18:43,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283841494]
[2024-11-19 17:18:43,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:18:43,506 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 17:18:43,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:18:43,508 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 17:18:43,508 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 17:18:43,508 INFO  L87              Difference]: Start difference. First operand 528 states and 745 transitions. Second operand  has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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-19 17:18:43,932 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:18:43,933 INFO  L93              Difference]: Finished difference Result 1447 states and 2032 transitions.
[2024-11-19 17:18:43,933 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 17:18:43,933 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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) Word has length 127
[2024-11-19 17:18:43,933 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:18:43,938 INFO  L225             Difference]: With dead ends: 1447
[2024-11-19 17:18:43,938 INFO  L226             Difference]: Without dead ends: 921
[2024-11-19 17:18:43,939 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-19 17:18:43,940 INFO  L432           NwaCegarLoop]: 51 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-19 17:18:43,941 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 56 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-19 17:18:43,942 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 921 states.
[2024-11-19 17:18:43,964 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 790.
[2024-11-19 17:18:43,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 790 states, 789 states have (on average 1.3219264892268694) internal successors, (1043), 789 states have internal predecessors, (1043), 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-19 17:18:43,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1043 transitions.
[2024-11-19 17:18:43,971 INFO  L78                 Accepts]: Start accepts. Automaton has 790 states and 1043 transitions. Word has length 127
[2024-11-19 17:18:43,971 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:18:43,971 INFO  L471      AbstractCegarLoop]: Abstraction has 790 states and 1043 transitions.
[2024-11-19 17:18:43,971 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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-19 17:18:43,972 INFO  L276                IsEmpty]: Start isEmpty. Operand 790 states and 1043 transitions.
[2024-11-19 17:18:43,974 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2024-11-19 17:18:43,974 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:18:43,975 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:18:43,975 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-19 17:18:43,975 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:18:43,976 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:18:43,976 INFO  L85        PathProgramCache]: Analyzing trace with hash 1310436254, now seen corresponding path program 1 times
[2024-11-19 17:18:43,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:18:43,976 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995698236]
[2024-11-19 17:18:43,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:18:43,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:18:44,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:18:44,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-19 17:18:44,197 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:18:44,197 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995698236]
[2024-11-19 17:18:44,198 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995698236] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:18:44,198 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:18:44,198 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 17:18:44,198 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053297813]
[2024-11-19 17:18:44,198 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:18:44,199 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 17:18:44,200 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:18:44,201 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 17:18:44,201 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 17:18:44,201 INFO  L87              Difference]: Start difference. First operand 790 states and 1043 transitions. Second operand  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-19 17:18:44,606 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:18:44,607 INFO  L93              Difference]: Finished difference Result 1840 states and 2437 transitions.
[2024-11-19 17:18:44,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 17:18:44,607 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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) Word has length 128
[2024-11-19 17:18:44,607 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:18:44,611 INFO  L225             Difference]: With dead ends: 1840
[2024-11-19 17:18:44,611 INFO  L226             Difference]: Without dead ends: 1052
[2024-11-19 17:18:44,612 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-19 17:18:44,613 INFO  L432           NwaCegarLoop]: 69 mSDtfsCounter, 127 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-19 17:18:44,614 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 74 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-19 17:18:44,615 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1052 states.
[2024-11-19 17:18:44,627 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921.
[2024-11-19 17:18:44,629 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 921 states, 920 states have (on average 1.2891304347826087) internal successors, (1186), 920 states have internal predecessors, (1186), 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-19 17:18:44,631 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1186 transitions.
[2024-11-19 17:18:44,632 INFO  L78                 Accepts]: Start accepts. Automaton has 921 states and 1186 transitions. Word has length 128
[2024-11-19 17:18:44,632 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:18:44,632 INFO  L471      AbstractCegarLoop]: Abstraction has 921 states and 1186 transitions.
[2024-11-19 17:18:44,632 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-19 17:18:44,633 INFO  L276                IsEmpty]: Start isEmpty. Operand 921 states and 1186 transitions.
[2024-11-19 17:18:44,635 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2024-11-19 17:18:44,635 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:18:44,635 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:18:44,635 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-19 17:18:44,636 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:18:44,636 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:18:44,636 INFO  L85        PathProgramCache]: Analyzing trace with hash 1497661910, now seen corresponding path program 1 times
[2024-11-19 17:18:44,636 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:18:44,637 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351850200]
[2024-11-19 17:18:44,637 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:18:44,637 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:18:44,668 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:18:44,815 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-19 17:18:44,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:18:44,817 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351850200]
[2024-11-19 17:18:44,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351850200] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:18:44,817 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:18:44,817 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 17:18:44,817 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861143834]
[2024-11-19 17:18:44,817 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:18:44,818 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 17:18:44,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:18:44,818 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 17:18:44,819 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 17:18:44,819 INFO  L87              Difference]: Start difference. First operand 921 states and 1186 transitions. Second operand  has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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-19 17:18:45,204 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:18:45,204 INFO  L93              Difference]: Finished difference Result 2102 states and 2723 transitions.
[2024-11-19 17:18:45,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 17:18:45,205 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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) Word has length 132
[2024-11-19 17:18:45,205 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:18:45,209 INFO  L225             Difference]: With dead ends: 2102
[2024-11-19 17:18:45,209 INFO  L226             Difference]: Without dead ends: 1183
[2024-11-19 17:18:45,210 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-19 17:18:45,214 INFO  L432           NwaCegarLoop]: 56 mSDtfsCounter, 129 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-19 17:18:45,215 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 61 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-19 17:18:45,216 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1183 states.
[2024-11-19 17:18:45,230 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183.
[2024-11-19 17:18:45,232 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1183 states, 1182 states have (on average 1.260575296108291) internal successors, (1490), 1182 states have internal predecessors, (1490), 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-19 17:18:45,235 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1490 transitions.
[2024-11-19 17:18:45,236 INFO  L78                 Accepts]: Start accepts. Automaton has 1183 states and 1490 transitions. Word has length 132
[2024-11-19 17:18:45,236 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:18:45,236 INFO  L471      AbstractCegarLoop]: Abstraction has 1183 states and 1490 transitions.
[2024-11-19 17:18:45,236 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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-19 17:18:45,236 INFO  L276                IsEmpty]: Start isEmpty. Operand 1183 states and 1490 transitions.
[2024-11-19 17:18:45,239 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2024-11-19 17:18:45,239 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:18:45,239 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:18:45,239 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-19 17:18:45,240 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:18:45,240 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:18:45,240 INFO  L85        PathProgramCache]: Analyzing trace with hash 2033432322, now seen corresponding path program 1 times
[2024-11-19 17:18:45,240 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:18:45,241 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607450942]
[2024-11-19 17:18:45,241 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:18:45,241 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:18:45,277 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:18:45,503 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-19 17:18:45,504 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:18:45,504 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607450942]
[2024-11-19 17:18:45,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607450942] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:18:45,505 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:18:45,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 17:18:45,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624419557]
[2024-11-19 17:18:45,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:18:45,506 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 17:18:45,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:18:45,507 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 17:18:45,507 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-19 17:18:45,507 INFO  L87              Difference]: Start difference. First operand 1183 states and 1490 transitions. Second operand  has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 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-19 17:18:46,183 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:18:46,183 INFO  L93              Difference]: Finished difference Result 2888 states and 3586 transitions.
[2024-11-19 17:18:46,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 17:18:46,184 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 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) Word has length 161
[2024-11-19 17:18:46,184 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:18:46,189 INFO  L225             Difference]: With dead ends: 2888
[2024-11-19 17:18:46,189 INFO  L226             Difference]: Without dead ends: 1576
[2024-11-19 17:18:46,191 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-19 17:18:46,192 INFO  L432           NwaCegarLoop]: 29 mSDtfsCounter, 274 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-19 17:18:46,192 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 39 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-19 17:18:46,194 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1576 states.
[2024-11-19 17:18:46,223 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576.
[2024-11-19 17:18:46,225 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1576 states, 1575 states have (on average 1.1352380952380952) internal successors, (1788), 1575 states have internal predecessors, (1788), 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-19 17:18:46,228 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1788 transitions.
[2024-11-19 17:18:46,229 INFO  L78                 Accepts]: Start accepts. Automaton has 1576 states and 1788 transitions. Word has length 161
[2024-11-19 17:18:46,230 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:18:46,232 INFO  L471      AbstractCegarLoop]: Abstraction has 1576 states and 1788 transitions.
[2024-11-19 17:18:46,233 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 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-19 17:18:46,233 INFO  L276                IsEmpty]: Start isEmpty. Operand 1576 states and 1788 transitions.
[2024-11-19 17:18:46,236 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 179
[2024-11-19 17:18:46,236 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:18:46,237 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:18:46,237 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-19 17:18:46,237 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:18:46,237 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:18:46,238 INFO  L85        PathProgramCache]: Analyzing trace with hash -606130043, now seen corresponding path program 1 times
[2024-11-19 17:18:46,238 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:18:46,238 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730990770]
[2024-11-19 17:18:46,238 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:18:46,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:18:46,278 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:18:46,502 INFO  L134       CoverageAnalysis]: Checked inductivity of 95 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-19 17:18:46,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:18:46,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730990770]
[2024-11-19 17:18:46,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730990770] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:18:46,506 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:18:46,506 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 17:18:46,506 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049825359]
[2024-11-19 17:18:46,506 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:18:46,506 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 17:18:46,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:18:46,507 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 17:18:46,507 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-19 17:18:46,507 INFO  L87              Difference]: Start difference. First operand 1576 states and 1788 transitions. Second operand  has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-19 17:18:47,130 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:18:47,130 INFO  L93              Difference]: Finished difference Result 3543 states and 4021 transitions.
[2024-11-19 17:18:47,130 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 17:18:47,131 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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) Word has length 178
[2024-11-19 17:18:47,131 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:18:47,136 INFO  L225             Difference]: With dead ends: 3543
[2024-11-19 17:18:47,137 INFO  L226             Difference]: Without dead ends: 1969
[2024-11-19 17:18:47,138 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-19 17:18:47,139 INFO  L432           NwaCegarLoop]: 18 mSDtfsCounter, 222 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-19 17:18:47,139 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 28 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-19 17:18:47,141 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1969 states.
[2024-11-19 17:18:47,161 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707.
[2024-11-19 17:18:47,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1707 states, 1706 states have (on average 1.130715123094959) internal successors, (1929), 1706 states have internal predecessors, (1929), 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-19 17:18:47,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1929 transitions.
[2024-11-19 17:18:47,166 INFO  L78                 Accepts]: Start accepts. Automaton has 1707 states and 1929 transitions. Word has length 178
[2024-11-19 17:18:47,167 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:18:47,167 INFO  L471      AbstractCegarLoop]: Abstraction has 1707 states and 1929 transitions.
[2024-11-19 17:18:47,167 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-19 17:18:47,167 INFO  L276                IsEmpty]: Start isEmpty. Operand 1707 states and 1929 transitions.
[2024-11-19 17:18:47,170 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 188
[2024-11-19 17:18:47,170 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:18:47,171 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:18:47,171 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-19 17:18:47,171 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:18:47,171 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:18:47,171 INFO  L85        PathProgramCache]: Analyzing trace with hash 951353973, now seen corresponding path program 1 times
[2024-11-19 17:18:47,172 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:18:47,172 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370256715]
[2024-11-19 17:18:47,172 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:18:47,172 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:18:47,201 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:18:47,466 INFO  L134       CoverageAnalysis]: Checked inductivity of 116 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked.
[2024-11-19 17:18:47,467 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:18:47,467 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370256715]
[2024-11-19 17:18:47,467 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370256715] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:18:47,467 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:18:47,467 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 17:18:47,467 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260556559]
[2024-11-19 17:18:47,467 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:18:47,468 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 17:18:47,468 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:18:47,469 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 17:18:47,469 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-19 17:18:47,469 INFO  L87              Difference]: Start difference. First operand 1707 states and 1929 transitions. Second operand  has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 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-19 17:18:47,988 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:18:47,988 INFO  L93              Difference]: Finished difference Result 3543 states and 4006 transitions.
[2024-11-19 17:18:47,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 17:18:47,989 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 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) Word has length 187
[2024-11-19 17:18:47,989 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:18:47,993 INFO  L225             Difference]: With dead ends: 3543
[2024-11-19 17:18:47,994 INFO  L226             Difference]: Without dead ends: 1838
[2024-11-19 17:18:47,995 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-19 17:18:47,996 INFO  L432           NwaCegarLoop]: 33 mSDtfsCounter, 372 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-19 17:18:47,996 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 42 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-19 17:18:47,998 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1838 states.
[2024-11-19 17:18:48,018 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838.
[2024-11-19 17:18:48,021 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1838 states, 1837 states have (on average 1.1197604790419162) internal successors, (2057), 1837 states have internal predecessors, (2057), 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-19 17:18:48,024 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2057 transitions.
[2024-11-19 17:18:48,024 INFO  L78                 Accepts]: Start accepts. Automaton has 1838 states and 2057 transitions. Word has length 187
[2024-11-19 17:18:48,024 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:18:48,024 INFO  L471      AbstractCegarLoop]: Abstraction has 1838 states and 2057 transitions.
[2024-11-19 17:18:48,024 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 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-19 17:18:48,025 INFO  L276                IsEmpty]: Start isEmpty. Operand 1838 states and 2057 transitions.
[2024-11-19 17:18:48,028 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2024-11-19 17:18:48,028 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:18:48,028 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:18:48,028 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-19 17:18:48,028 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:18:48,029 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:18:48,029 INFO  L85        PathProgramCache]: Analyzing trace with hash -80166730, now seen corresponding path program 1 times
[2024-11-19 17:18:48,029 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:18:48,029 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99048460]
[2024-11-19 17:18:48,029 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:18:48,029 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:18:48,070 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:18:48,230 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-11-19 17:18:48,230 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:18:48,230 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99048460]
[2024-11-19 17:18:48,230 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99048460] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:18:48,230 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:18:48,230 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 17:18:48,231 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244575242]
[2024-11-19 17:18:48,231 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:18:48,231 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 17:18:48,231 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:18:48,232 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 17:18:48,232 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 17:18:48,233 INFO  L87              Difference]: Start difference. First operand 1838 states and 2057 transitions. Second operand  has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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-19 17:18:48,587 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:18:48,587 INFO  L93              Difference]: Finished difference Result 3936 states and 4385 transitions.
[2024-11-19 17:18:48,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 17:18:48,591 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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) Word has length 205
[2024-11-19 17:18:48,591 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:18:48,596 INFO  L225             Difference]: With dead ends: 3936
[2024-11-19 17:18:48,596 INFO  L226             Difference]: Without dead ends: 2100
[2024-11-19 17:18:48,599 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-19 17:18:48,599 INFO  L432           NwaCegarLoop]: 172 mSDtfsCounter, 88 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-19 17:18:48,599 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 177 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-19 17:18:48,601 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2100 states.
[2024-11-19 17:18:48,622 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969.
[2024-11-19 17:18:48,625 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1969 states, 1968 states have (on average 1.0960365853658536) internal successors, (2157), 1968 states have internal predecessors, (2157), 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-19 17:18:48,627 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2157 transitions.
[2024-11-19 17:18:48,628 INFO  L78                 Accepts]: Start accepts. Automaton has 1969 states and 2157 transitions. Word has length 205
[2024-11-19 17:18:48,628 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:18:48,628 INFO  L471      AbstractCegarLoop]: Abstraction has 1969 states and 2157 transitions.
[2024-11-19 17:18:48,628 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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-19 17:18:48,628 INFO  L276                IsEmpty]: Start isEmpty. Operand 1969 states and 2157 transitions.
[2024-11-19 17:18:48,632 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 228
[2024-11-19 17:18:48,632 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:18:48,632 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:18:48,632 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-19 17:18:48,632 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:18:48,632 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:18:48,633 INFO  L85        PathProgramCache]: Analyzing trace with hash 119864767, now seen corresponding path program 1 times
[2024-11-19 17:18:48,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:18:48,633 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399232732]
[2024-11-19 17:18:48,633 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:18:48,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:18:48,673 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:18:48,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked.
[2024-11-19 17:18:48,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:18:48,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399232732]
[2024-11-19 17:18:48,865 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399232732] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:18:48,865 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:18:48,865 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 17:18:48,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444320965]
[2024-11-19 17:18:48,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:18:48,865 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 17:18:48,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:18:48,866 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 17:18:48,866 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 17:18:48,866 INFO  L87              Difference]: Start difference. First operand 1969 states and 2157 transitions. Second operand  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-19 17:18:49,195 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:18:49,196 INFO  L93              Difference]: Finished difference Result 2626 states and 2854 transitions.
[2024-11-19 17:18:49,196 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 17:18:49,196 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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) Word has length 227
[2024-11-19 17:18:49,197 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:18:49,205 INFO  L225             Difference]: With dead ends: 2626
[2024-11-19 17:18:49,206 INFO  L226             Difference]: Without dead ends: 2624
[2024-11-19 17:18:49,207 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-19 17:18:49,207 INFO  L432           NwaCegarLoop]: 25 mSDtfsCounter, 40 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-19 17:18:49,208 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 30 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-19 17:18:49,210 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2624 states.
[2024-11-19 17:18:49,234 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1969.
[2024-11-19 17:18:49,237 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1969 states, 1968 states have (on average 1.0955284552845528) internal successors, (2156), 1968 states have internal predecessors, (2156), 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-19 17:18:49,240 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2156 transitions.
[2024-11-19 17:18:49,240 INFO  L78                 Accepts]: Start accepts. Automaton has 1969 states and 2156 transitions. Word has length 227
[2024-11-19 17:18:49,241 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:18:49,241 INFO  L471      AbstractCegarLoop]: Abstraction has 1969 states and 2156 transitions.
[2024-11-19 17:18:49,241 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-19 17:18:49,241 INFO  L276                IsEmpty]: Start isEmpty. Operand 1969 states and 2156 transitions.
[2024-11-19 17:18:49,246 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 283
[2024-11-19 17:18:49,246 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 17:18:49,246 INFO  L215           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:18:49,247 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-19 17:18:49,247 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 17:18:49,247 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 17:18:49,247 INFO  L85        PathProgramCache]: Analyzing trace with hash 965110583, now seen corresponding path program 1 times
[2024-11-19 17:18:49,247 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 17:18:49,248 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180436247]
[2024-11-19 17:18:49,248 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 17:18:49,248 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 17:18:49,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 17:18:49,902 INFO  L134       CoverageAnalysis]: Checked inductivity of 407 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked.
[2024-11-19 17:18:49,902 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 17:18:49,902 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180436247]
[2024-11-19 17:18:49,902 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180436247] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 17:18:49,902 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 17:18:49,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 17:18:49,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618419188]
[2024-11-19 17:18:49,903 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 17:18:49,903 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 17:18:49,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 17:18:49,903 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 17:18:49,904 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-19 17:18:49,904 INFO  L87              Difference]: Start difference. First operand 1969 states and 2156 transitions. Second operand  has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 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-19 17:18:50,421 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 17:18:50,421 INFO  L93              Difference]: Finished difference Result 4065 states and 4443 transitions.
[2024-11-19 17:18:50,422 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 17:18:50,422 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 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) Word has length 282
[2024-11-19 17:18:50,422 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 17:18:50,423 INFO  L225             Difference]: With dead ends: 4065
[2024-11-19 17:18:50,423 INFO  L226             Difference]: Without dead ends: 0
[2024-11-19 17:18:50,427 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-19 17:18:50,427 INFO  L432           NwaCegarLoop]: 33 mSDtfsCounter, 334 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-19 17:18:50,428 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 41 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-19 17:18:50,428 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-19 17:18:50,428 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-19 17:18:50,429 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-19 17:18:50,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-19 17:18:50,429 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 282
[2024-11-19 17:18:50,429 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 17:18:50,429 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-19 17:18:50,429 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 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-19 17:18:50,430 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-19 17:18:50,430 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-19 17:18:50,432 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-19 17:18:50,433 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-19 17:18:50,436 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 17:18:50,440 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-19 17:18:50,623 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-19 17:18:50,640 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:18:50 BoogieIcfgContainer
[2024-11-19 17:18:50,640 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-19 17:18:50,641 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-19 17:18:50,641 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-19 17:18:50,641 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-19 17:18:50,642 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:18:40" (3/4) ...
[2024-11-19 17:18:50,644 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-19 17:18:50,662 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-19 17:18:50,664 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-19 17:18:50,665 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-19 17:18:50,666 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-19 17:18:50,819 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-19 17:18:50,821 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-19 17:18:50,822 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-19 17:18:50,822 INFO  L158              Benchmark]: Toolchain (without parser) took 11831.39ms. Allocated memory was 165.7MB in the beginning and 276.8MB in the end (delta: 111.1MB). Free memory was 91.2MB in the beginning and 209.4MB in the end (delta: -118.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-19 17:18:50,822 INFO  L158              Benchmark]: CDTParser took 0.17ms. Allocated memory is still 165.7MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-19 17:18:50,823 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 592.66ms. Allocated memory is still 165.7MB. Free memory was 90.9MB in the beginning and 125.6MB in the end (delta: -34.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2024-11-19 17:18:50,823 INFO  L158              Benchmark]: Boogie Procedure Inliner took 75.99ms. Allocated memory is still 165.7MB. Free memory was 125.6MB in the beginning and 119.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-19 17:18:50,823 INFO  L158              Benchmark]: Boogie Preprocessor took 134.77ms. Allocated memory is still 165.7MB. Free memory was 119.3MB in the beginning and 114.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-19 17:18:50,823 INFO  L158              Benchmark]: RCFGBuilder took 1190.79ms. Allocated memory is still 165.7MB. Free memory was 114.3MB in the beginning and 109.6MB in the end (delta: 4.7MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB.
[2024-11-19 17:18:50,823 INFO  L158              Benchmark]: TraceAbstraction took 9649.00ms. Allocated memory was 165.7MB in the beginning and 276.8MB in the end (delta: 111.1MB). Free memory was 108.5MB in the beginning and 222.0MB in the end (delta: -113.5MB). Peak memory consumption was 141.6MB. Max. memory is 16.1GB.
[2024-11-19 17:18:50,824 INFO  L158              Benchmark]: Witness Printer took 180.79ms. Allocated memory is still 276.8MB. Free memory was 222.0MB in the beginning and 209.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-11-19 17:18:50,825 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.17ms. Allocated memory is still 165.7MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 592.66ms. Allocated memory is still 165.7MB. Free memory was 90.9MB in the beginning and 125.6MB in the end (delta: -34.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 75.99ms. Allocated memory is still 165.7MB. Free memory was 125.6MB in the beginning and 119.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 134.77ms. Allocated memory is still 165.7MB. Free memory was 119.3MB in the beginning and 114.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1190.79ms. Allocated memory is still 165.7MB. Free memory was 114.3MB in the beginning and 109.6MB in the end (delta: 4.7MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB.
 * TraceAbstraction took 9649.00ms. Allocated memory was 165.7MB in the beginning and 276.8MB in the end (delta: 111.1MB). Free memory was 108.5MB in the beginning and 222.0MB in the end (delta: -113.5MB). Peak memory consumption was 141.6MB. Max. memory is 16.1GB.
 * Witness Printer took 180.79ms. Allocated memory is still 276.8MB. Free memory was 222.0MB in the beginning and 209.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 522]: 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 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1963 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1963 mSDsluCounter, 621 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 838 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4371 IncrementalHoareTripleChecker+Invalid, 5209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 838 mSolverCounterUnsat, 547 mSDtfsCounter, 4371 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=9, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1310 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1856 NumberOfCodeBlocks, 1856 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1845 ConstructedInterpolants, 0 QuantifiedInterpolants, 3447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 1085/1085 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: 593]: Loop Invariant
    Derived loop invariant: (((((((a21 == 1) && (a16 <= 5)) || (((a16 == 6) && (a21 == 1)) && (15 <= a8))) || ((a16 == 6) && (a20 == 1))) || ((a16 <= 5) && (a20 == 1))) || ((a21 == 1) && (a20 == 1))) || ((a17 == 1) && (a16 <= 5)))
RESULT: Ultimate proved your program to be correct!
[2024-11-19 17:18:50,850 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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