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


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


Checking for ERROR reachability
Using default analysis
Version 023d838f
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-33.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 113218720f1f4faf2eddef9adf1222c3b46ebe55dc41f5c9bc7cb247cb4bfba6
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m
[2024-11-10 06:30:29,638 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-10 06:30:29,712 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-10 06:30:29,716 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-10 06:30:29,718 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-10 06:30:29,753 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-10 06:30:29,754 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-10 06:30:29,754 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-10 06:30:29,755 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-10 06:30:29,757 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-10 06:30:29,758 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-10 06:30:29,758 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-10 06:30:29,759 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-10 06:30:29,761 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-10 06:30:29,761 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-10 06:30:29,761 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-10 06:30:29,762 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-10 06:30:29,762 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-10 06:30:29,762 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-10 06:30:29,763 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-10 06:30:29,763 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-10 06:30:29,775 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-10 06:30:29,775 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-10 06:30:29,776 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-10 06:30:29,776 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-10 06:30:29,776 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-10 06:30:29,777 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-10 06:30:29,777 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-10 06:30:29,777 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-10 06:30:29,778 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-10 06:30:29,778 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-10 06:30:29,778 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-10 06:30:29,778 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-10 06:30:29,779 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-10 06:30:29,779 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-10 06:30:29,779 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-10 06:30:29,780 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-10 06:30:29,781 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-10 06:30:29,781 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-10 06:30:29,781 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-10 06:30:29,781 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-10 06:30:29,782 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-10 06:30:29,783 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 -> 113218720f1f4faf2eddef9adf1222c3b46ebe55dc41f5c9bc7cb247cb4bfba6
[2024-11-10 06:30:30,116 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-10 06:30:30,145 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-10 06:30:30,148 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-10 06:30:30,149 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-10 06:30:30,150 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-10 06:30:30,151 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-33.i
[2024-11-10 06:30:31,847 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-10 06:30:32,064 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-10 06:30:32,066 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-33.i
[2024-11-10 06:30:32,078 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30776a55e/669643e625cc4ac892206b35b003901f/FLAG714294fa2
[2024-11-10 06:30:32,092 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30776a55e/669643e625cc4ac892206b35b003901f
[2024-11-10 06:30:32,096 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-10 06:30:32,097 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-10 06:30:32,098 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-10 06:30:32,098 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-10 06:30:32,106 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-10 06:30:32,107 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:30:32" (1/1) ...
[2024-11-10 06:30:32,108 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@934061d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:32, skipping insertion in model container
[2024-11-10 06:30:32,108 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:30:32" (1/1) ...
[2024-11-10 06:30:32,141 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-10 06:30:32,349 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-33.i[913,926]
[2024-11-10 06:30:32,432 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-10 06:30:32,450 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-10 06:30:32,464 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-33.i[913,926]
[2024-11-10 06:30:32,507 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-10 06:30:32,536 INFO  L204         MainTranslator]: Completed translation
[2024-11-10 06:30:32,537 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:32 WrapperNode
[2024-11-10 06:30:32,537 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-10 06:30:32,538 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-10 06:30:32,539 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-10 06:30:32,539 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-10 06:30:32,546 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:32" (1/1) ...
[2024-11-10 06:30:32,555 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:32" (1/1) ...
[2024-11-10 06:30:32,595 INFO  L138                Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149
[2024-11-10 06:30:32,595 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-10 06:30:32,596 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-10 06:30:32,596 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-10 06:30:32,596 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-10 06:30:32,608 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:32" (1/1) ...
[2024-11-10 06:30:32,609 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:32" (1/1) ...
[2024-11-10 06:30:32,614 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:32" (1/1) ...
[2024-11-10 06:30:32,632 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-10 06:30:32,633 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:32" (1/1) ...
[2024-11-10 06:30:32,633 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:32" (1/1) ...
[2024-11-10 06:30:32,641 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:32" (1/1) ...
[2024-11-10 06:30:32,642 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:32" (1/1) ...
[2024-11-10 06:30:32,644 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:32" (1/1) ...
[2024-11-10 06:30:32,648 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:32" (1/1) ...
[2024-11-10 06:30:32,652 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-10 06:30:32,653 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2024-11-10 06:30:32,653 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2024-11-10 06:30:32,653 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2024-11-10 06:30:32,654 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:32" (1/1) ...
[2024-11-10 06:30:32,670 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-10 06:30:32,687 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-10 06:30:32,710 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-10 06:30:32,714 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-10 06:30:32,765 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-10 06:30:32,766 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-10 06:30:32,767 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-10 06:30:32,767 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-10 06:30:32,767 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-10 06:30:32,767 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-10 06:30:32,871 INFO  L256             CfgBuilder]: Building ICFG
[2024-11-10 06:30:32,874 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-10 06:30:33,276 INFO  L1247  $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;
[2024-11-10 06:30:33,320 INFO  L?                        ?]: Removed 15 outVars from TransFormulas that were not future-live.
[2024-11-10 06:30:33,320 INFO  L307             CfgBuilder]: Performing block encoding
[2024-11-10 06:30:33,355 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-10 06:30:33,356 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-10 06:30:33,356 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:30:33 BoogieIcfgContainer
[2024-11-10 06:30:33,357 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2024-11-10 06:30:33,360 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-10 06:30:33,360 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-10 06:30:33,364 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-10 06:30:33,364 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:30:32" (1/3) ...
[2024-11-10 06:30:33,365 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f3ee9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:30:33, skipping insertion in model container
[2024-11-10 06:30:33,367 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:32" (2/3) ...
[2024-11-10 06:30:33,367 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f3ee9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:30:33, skipping insertion in model container
[2024-11-10 06:30:33,367 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:30:33" (3/3) ...
[2024-11-10 06:30:33,371 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-33.i
[2024-11-10 06:30:33,396 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-10 06:30:33,398 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-10 06:30:33,484 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-10 06:30:33,490 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;@177aa06f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-10 06:30:33,491 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-10 06:30:33,495 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 68 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2024-11-10 06:30:33,505 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2024-11-10 06:30:33,505 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-10 06:30:33,506 INFO  L215           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-10 06:30:33,506 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-10 06:30:33,511 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 06:30:33,511 INFO  L85        PathProgramCache]: Analyzing trace with hash -1062846036, now seen corresponding path program 1 times
[2024-11-10 06:30:33,520 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 06:30:33,521 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341491051]
[2024-11-10 06:30:33,521 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 06:30:33,521 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 06:30:33,680 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:33,872 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2024-11-10 06:30:33,875 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:33,887 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-10 06:30:33,890 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:33,897 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-10 06:30:33,899 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:33,905 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-10 06:30:33,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:33,914 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-11-10 06:30:33,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:33,926 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-10 06:30:33,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:33,937 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-10 06:30:33,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:33,945 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-10 06:30:33,951 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:33,959 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-10 06:30:33,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:33,970 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-10 06:30:33,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:33,980 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-10 06:30:33,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:33,985 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-10 06:30:33,987 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:33,990 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-10 06:30:33,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:33,995 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-10 06:30:33,997 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:34,000 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-10 06:30:34,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:34,006 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-10 06:30:34,008 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:34,014 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-10 06:30:34,020 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:34,025 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-10 06:30:34,028 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:34,037 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-10 06:30:34,041 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 06:30:34,041 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341491051]
[2024-11-10 06:30:34,042 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341491051] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 06:30:34,042 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 06:30:34,042 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-10 06:30:34,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119552864]
[2024-11-10 06:30:34,046 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 06:30:34,052 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-10 06:30:34,053 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 06:30:34,080 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-10 06:30:34,081 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-10 06:30:34,083 INFO  L87              Difference]: Start difference. First operand  has 68 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand  has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18)
[2024-11-10 06:30:34,114 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-10 06:30:34,115 INFO  L93              Difference]: Finished difference Result 128 states and 211 transitions.
[2024-11-10 06:30:34,118 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-10 06:30:34,120 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120
[2024-11-10 06:30:34,120 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-10 06:30:34,135 INFO  L225             Difference]: With dead ends: 128
[2024-11-10 06:30:34,136 INFO  L226             Difference]: Without dead ends: 63
[2024-11-10 06:30:34,142 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-10 06:30:34,151 INFO  L432           NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-10 06:30:34,153 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-10 06:30:34,176 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2024-11-10 06:30:34,206 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63.
[2024-11-10 06:30:34,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 63 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2024-11-10 06:30:34,212 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions.
[2024-11-10 06:30:34,216 INFO  L78                 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 120
[2024-11-10 06:30:34,217 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-10 06:30:34,219 INFO  L471      AbstractCegarLoop]: Abstraction has 63 states and 91 transitions.
[2024-11-10 06:30:34,219 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18)
[2024-11-10 06:30:34,220 INFO  L276                IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions.
[2024-11-10 06:30:34,224 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2024-11-10 06:30:34,224 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-10 06:30:34,224 INFO  L215           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-10 06:30:34,225 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-10 06:30:34,225 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-10 06:30:34,228 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 06:30:34,229 INFO  L85        PathProgramCache]: Analyzing trace with hash 777726348, now seen corresponding path program 1 times
[2024-11-10 06:30:34,230 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 06:30:34,230 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228180038]
[2024-11-10 06:30:34,230 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 06:30:34,231 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 06:30:34,465 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,161 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2024-11-10 06:30:35,167 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,185 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-10 06:30:35,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,208 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-10 06:30:35,213 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,236 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-10 06:30:35,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,256 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-11-10 06:30:35,263 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,273 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-10 06:30:35,276 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,288 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-10 06:30:35,292 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,303 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-10 06:30:35,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,315 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-10 06:30:35,318 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,328 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-10 06:30:35,332 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,339 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-10 06:30:35,345 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,353 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-10 06:30:35,357 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,369 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-10 06:30:35,376 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,388 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-10 06:30:35,394 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,403 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-10 06:30:35,408 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,416 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-10 06:30:35,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,432 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-10 06:30:35,435 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,443 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-10 06:30:35,447 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:35,461 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-10 06:30:35,462 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 06:30:35,463 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228180038]
[2024-11-10 06:30:35,463 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228180038] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 06:30:35,463 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 06:30:35,464 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-10 06:30:35,464 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85519026]
[2024-11-10 06:30:35,464 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 06:30:35,466 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-10 06:30:35,466 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 06:30:35,467 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-10 06:30:35,468 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-10 06:30:35,469 INFO  L87              Difference]: Start difference. First operand 63 states and 91 transitions. Second operand  has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-10 06:30:35,850 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-10 06:30:35,851 INFO  L93              Difference]: Finished difference Result 189 states and 276 transitions.
[2024-11-10 06:30:35,852 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-10 06:30:35,852 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120
[2024-11-10 06:30:35,853 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-10 06:30:35,855 INFO  L225             Difference]: With dead ends: 189
[2024-11-10 06:30:35,858 INFO  L226             Difference]: Without dead ends: 129
[2024-11-10 06:30:35,859 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-10 06:30:35,860 INFO  L432           NwaCegarLoop]: 73 mSDtfsCounter, 70 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-10 06:30:35,861 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 209 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-10 06:30:35,863 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2024-11-10 06:30:35,893 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113.
[2024-11-10 06:30:35,894 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 113 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36)
[2024-11-10 06:30:35,896 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 166 transitions.
[2024-11-10 06:30:35,897 INFO  L78                 Accepts]: Start accepts. Automaton has 113 states and 166 transitions. Word has length 120
[2024-11-10 06:30:35,897 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-10 06:30:35,897 INFO  L471      AbstractCegarLoop]: Abstraction has 113 states and 166 transitions.
[2024-11-10 06:30:35,898 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-10 06:30:35,898 INFO  L276                IsEmpty]: Start isEmpty. Operand 113 states and 166 transitions.
[2024-11-10 06:30:35,901 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2024-11-10 06:30:35,901 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-10 06:30:35,901 INFO  L215           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-10 06:30:35,901 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-10 06:30:35,902 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-10 06:30:35,902 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 06:30:35,902 INFO  L85        PathProgramCache]: Analyzing trace with hash 768863702, now seen corresponding path program 1 times
[2024-11-10 06:30:35,902 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 06:30:35,903 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027296392]
[2024-11-10 06:30:35,903 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 06:30:35,903 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 06:30:35,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,184 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2024-11-10 06:30:36,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,193 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-10 06:30:36,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,200 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-10 06:30:36,204 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,208 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-10 06:30:36,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,214 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-11-10 06:30:36,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,222 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-10 06:30:36,224 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,228 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-10 06:30:36,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,234 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-10 06:30:36,235 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,243 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-10 06:30:36,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,249 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-10 06:30:36,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,255 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-10 06:30:36,259 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,267 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-10 06:30:36,270 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,277 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-10 06:30:36,279 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,286 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-10 06:30:36,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,292 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-10 06:30:36,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,298 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-10 06:30:36,301 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,304 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-10 06:30:36,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,310 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-10 06:30:36,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:36,317 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-10 06:30:36,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 06:30:36,317 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027296392]
[2024-11-10 06:30:36,318 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027296392] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 06:30:36,318 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 06:30:36,318 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-10 06:30:36,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119820455]
[2024-11-10 06:30:36,318 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 06:30:36,319 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-10 06:30:36,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 06:30:36,320 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-10 06:30:36,320 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-10 06:30:36,320 INFO  L87              Difference]: Start difference. First operand 113 states and 166 transitions. Second operand  has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-10 06:30:36,513 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-10 06:30:36,513 INFO  L93              Difference]: Finished difference Result 198 states and 287 transitions.
[2024-11-10 06:30:36,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-10 06:30:36,514 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121
[2024-11-10 06:30:36,515 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-10 06:30:36,516 INFO  L225             Difference]: With dead ends: 198
[2024-11-10 06:30:36,516 INFO  L226             Difference]: Without dead ends: 125
[2024-11-10 06:30:36,517 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-10 06:30:36,518 INFO  L432           NwaCegarLoop]: 73 mSDtfsCounter, 67 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-10 06:30:36,522 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 214 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-10 06:30:36,523 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 125 states.
[2024-11-10 06:30:36,555 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114.
[2024-11-10 06:30:36,557 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 114 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 75 states have internal predecessors, (94), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36)
[2024-11-10 06:30:36,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 166 transitions.
[2024-11-10 06:30:36,562 INFO  L78                 Accepts]: Start accepts. Automaton has 114 states and 166 transitions. Word has length 121
[2024-11-10 06:30:36,563 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-10 06:30:36,563 INFO  L471      AbstractCegarLoop]: Abstraction has 114 states and 166 transitions.
[2024-11-10 06:30:36,564 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-10 06:30:36,565 INFO  L276                IsEmpty]: Start isEmpty. Operand 114 states and 166 transitions.
[2024-11-10 06:30:36,566 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2024-11-10 06:30:36,570 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-10 06:30:36,570 INFO  L215           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-10 06:30:36,571 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-10 06:30:36,571 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-10 06:30:36,571 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 06:30:36,572 INFO  L85        PathProgramCache]: Analyzing trace with hash 2087938593, now seen corresponding path program 1 times
[2024-11-10 06:30:36,572 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 06:30:36,572 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676344707]
[2024-11-10 06:30:36,572 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 06:30:36,572 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 06:30:36,724 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,892 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2024-11-10 06:30:47,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,900 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-10 06:30:47,901 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,907 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-10 06:30:47,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,913 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-10 06:30:47,916 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,919 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-11-10 06:30:47,921 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,923 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-10 06:30:47,925 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,928 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-10 06:30:47,930 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,932 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-10 06:30:47,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,938 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-10 06:30:47,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,942 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-10 06:30:47,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,949 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-10 06:30:47,951 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,954 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-10 06:30:47,956 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,961 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-10 06:30:47,964 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,967 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-10 06:30:47,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,973 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-10 06:30:47,975 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,980 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-10 06:30:47,981 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,984 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-10 06:30:47,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,989 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-10 06:30:47,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:30:47,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-10 06:30:47,996 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 06:30:47,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676344707]
[2024-11-10 06:30:47,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676344707] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 06:30:47,997 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 06:30:47,997 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2024-11-10 06:30:47,997 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256590885]
[2024-11-10 06:30:47,997 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 06:30:47,998 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-10 06:30:47,999 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 06:30:48,000 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-10 06:30:48,001 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182
[2024-11-10 06:30:48,001 INFO  L87              Difference]: Start difference. First operand 114 states and 166 transitions. Second operand  has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)
[2024-11-10 06:30:51,896 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-10 06:30:51,896 INFO  L93              Difference]: Finished difference Result 328 states and 459 transitions.
[2024-11-10 06:30:51,899 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-11-10 06:30:51,900 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 122
[2024-11-10 06:30:51,900 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-10 06:30:51,902 INFO  L225             Difference]: With dead ends: 328
[2024-11-10 06:30:51,902 INFO  L226             Difference]: Without dead ends: 268
[2024-11-10 06:30:51,907 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650
[2024-11-10 06:30:51,909 INFO  L432           NwaCegarLoop]: 121 mSDtfsCounter, 268 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2024-11-10 06:30:51,909 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 793 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2024-11-10 06:30:51,914 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 268 states.
[2024-11-10 06:30:51,955 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 207.
[2024-11-10 06:30:51,959 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 207 states, 148 states have (on average 1.2837837837837838) internal successors, (190), 148 states have internal predecessors, (190), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54)
[2024-11-10 06:30:51,961 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 298 transitions.
[2024-11-10 06:30:51,965 INFO  L78                 Accepts]: Start accepts. Automaton has 207 states and 298 transitions. Word has length 122
[2024-11-10 06:30:51,966 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-10 06:30:51,966 INFO  L471      AbstractCegarLoop]: Abstraction has 207 states and 298 transitions.
[2024-11-10 06:30:51,967 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)
[2024-11-10 06:30:51,967 INFO  L276                IsEmpty]: Start isEmpty. Operand 207 states and 298 transitions.
[2024-11-10 06:30:51,968 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2024-11-10 06:30:51,968 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-10 06:30:51,968 INFO  L215           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-10 06:30:51,969 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-10 06:30:51,969 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-10 06:30:51,969 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 06:30:51,969 INFO  L85        PathProgramCache]: Analyzing trace with hash 290987234, now seen corresponding path program 1 times
[2024-11-10 06:30:51,969 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 06:30:51,970 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842039627]
[2024-11-10 06:30:51,970 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 06:30:51,970 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 06:30:52,083 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,006 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2024-11-10 06:31:00,009 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,011 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-10 06:31:00,013 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,015 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-10 06:31:00,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,077 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-10 06:31:00,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,082 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-11-10 06:31:00,083 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,086 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-10 06:31:00,088 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,090 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-10 06:31:00,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,095 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-10 06:31:00,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,099 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-10 06:31:00,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,104 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-10 06:31:00,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,108 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-10 06:31:00,110 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,113 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-10 06:31:00,114 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,117 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-10 06:31:00,119 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,121 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-10 06:31:00,123 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,125 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-10 06:31:00,127 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,134 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-10 06:31:00,137 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,142 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-10 06:31:00,144 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,150 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-10 06:31:00,153 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked.
[2024-11-10 06:31:00,158 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 06:31:00,158 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842039627]
[2024-11-10 06:31:00,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842039627] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-10 06:31:00,159 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461462146]
[2024-11-10 06:31:00,159 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 06:31:00,161 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-10 06:31:00,161 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-10 06:31:00,164 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-10 06:31:00,167 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-10 06:31:00,279 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 06:31:00,287 INFO  L255         TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 31 conjuncts are in the unsatisfiable core
[2024-11-10 06:31:00,312 INFO  L278         TraceCheckSpWp]: Computing forward predicates...