./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-63.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 84cfde4a
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-63.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 31ed4c1d4c56093916e3e6078a050f9b467d4295a9560366c0e4e3c015413196
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-84cfde4
[2024-10-11 10:57:57,611 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-10-11 10:57:57,690 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-10-11 10:57:57,695 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-10-11 10:57:57,697 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-11 10:57:57,725 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-11 10:57:57,726 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-11 10:57:57,727 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-11 10:57:57,727 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-10-11 10:57:57,728 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-10-11 10:57:57,729 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-11 10:57:57,729 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-11 10:57:57,729 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-11 10:57:57,730 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-10-11 10:57:57,731 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-10-11 10:57:57,732 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-11 10:57:57,732 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-10-11 10:57:57,732 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-10-11 10:57:57,733 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-10-11 10:57:57,733 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-10-11 10:57:57,733 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-10-11 10:57:57,737 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-10-11 10:57:57,737 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-11 10:57:57,738 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-10-11 10:57:57,738 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-10-11 10:57:57,738 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-10-11 10:57:57,738 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-10-11 10:57:57,738 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-10-11 10:57:57,739 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-11 10:57:57,739 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-10-11 10:57:57,739 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-10-11 10:57:57,739 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-10-11 10:57:57,739 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-11 10:57:57,740 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-11 10:57:57,740 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-10-11 10:57:57,740 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-11 10:57:57,740 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-10-11 10:57:57,740 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-11 10:57:57,741 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-11 10:57:57,741 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-11 10:57:57,741 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-10-11 10:57:57,743 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-11 10:57:57,744 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-clean/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-clean/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 -> 31ed4c1d4c56093916e3e6078a050f9b467d4295a9560366c0e4e3c015413196
[2024-10-11 10:57:57,983 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-11 10:57:58,010 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-11 10:57:58,012 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-11 10:57:58,014 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-10-11 10:57:58,015 INFO  L274        PluginConnector]: CDTParser initialized
[2024-10-11 10:57:58,016 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-63.i
[2024-10-11 10:57:59,512 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-10-11 10:57:59,710 INFO  L384              CDTParser]: Found 1 translation units.
[2024-10-11 10:57:59,711 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-63.i
[2024-10-11 10:57:59,723 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7419a304d/d68d1174dd5b4d798a12b3755cdf5192/FLAGf1261412c
[2024-10-11 10:57:59,736 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7419a304d/d68d1174dd5b4d798a12b3755cdf5192
[2024-10-11 10:57:59,739 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-11 10:57:59,740 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-11 10:57:59,744 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-11 10:57:59,745 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-11 10:57:59,750 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-11 10:57:59,750 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:57:59" (1/1) ...
[2024-10-11 10:57:59,751 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30bbbddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:57:59, skipping insertion in model container
[2024-10-11 10:57:59,752 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:57:59" (1/1) ...
[2024-10-11 10:57:59,778 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-10-11 10:57:59,954 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-63.i[916,929]
[2024-10-11 10:57:59,996 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-11 10:58:00,008 INFO  L200         MainTranslator]: Completed pre-run
[2024-10-11 10:58:00,032 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-63.i[916,929]
[2024-10-11 10:58:00,054 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-11 10:58:00,078 INFO  L204         MainTranslator]: Completed translation
[2024-10-11 10:58:00,078 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:00 WrapperNode
[2024-10-11 10:58:00,079 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-11 10:58:00,080 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-11 10:58:00,080 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-11 10:58:00,080 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-11 10:58:00,086 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:00" (1/1) ...
[2024-10-11 10:58:00,093 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:00" (1/1) ...
[2024-10-11 10:58:00,118 INFO  L138                Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130
[2024-10-11 10:58:00,118 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-11 10:58:00,119 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-11 10:58:00,119 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-11 10:58:00,119 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-10-11 10:58:00,128 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:00" (1/1) ...
[2024-10-11 10:58:00,129 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:00" (1/1) ...
[2024-10-11 10:58:00,131 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:00" (1/1) ...
[2024-10-11 10:58:00,144 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-10-11 10:58:00,145 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:00" (1/1) ...
[2024-10-11 10:58:00,145 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:00" (1/1) ...
[2024-10-11 10:58:00,150 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:00" (1/1) ...
[2024-10-11 10:58:00,155 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:00" (1/1) ...
[2024-10-11 10:58:00,156 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:00" (1/1) ...
[2024-10-11 10:58:00,157 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:00" (1/1) ...
[2024-10-11 10:58:00,160 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-11 10:58:00,161 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-11 10:58:00,161 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-10-11 10:58:00,161 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-10-11 10:58:00,162 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:00" (1/1) ...
[2024-10-11 10:58:00,170 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-11 10:58:00,184 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3
[2024-10-11 10:58:00,200 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-10-11 10:58:00,203 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-10-11 10:58:00,249 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-11 10:58:00,250 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-10-11 10:58:00,250 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-10-11 10:58:00,250 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-10-11 10:58:00,250 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-11 10:58:00,250 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-11 10:58:00,339 INFO  L238             CfgBuilder]: Building ICFG
[2024-10-11 10:58:00,341 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-11 10:58:00,615 INFO  L?                        ?]: Removed 10 outVars from TransFormulas that were not future-live.
[2024-10-11 10:58:00,615 INFO  L287             CfgBuilder]: Performing block encoding
[2024-10-11 10:58:00,696 INFO  L309             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-11 10:58:00,697 INFO  L314             CfgBuilder]: Removed 1 assume(true) statements.
[2024-10-11 10:58:00,697 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:58:00 BoogieIcfgContainer
[2024-10-11 10:58:00,701 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-11 10:58:00,703 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-11 10:58:00,704 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-10-11 10:58:00,706 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-10-11 10:58:00,707 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:57:59" (1/3) ...
[2024-10-11 10:58:00,707 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13efbe0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:58:00, skipping insertion in model container
[2024-10-11 10:58:00,707 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:00" (2/3) ...
[2024-10-11 10:58:00,708 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13efbe0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:58:00, skipping insertion in model container
[2024-10-11 10:58:00,708 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:58:00" (3/3) ...
[2024-10-11 10:58:00,709 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-63.i
[2024-10-11 10:58:00,723 INFO  L209   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-11 10:58:00,723 INFO  L149   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-10-11 10:58:00,781 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-11 10:58:00,788 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;@5987099, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-11 10:58:00,788 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-10-11 10:58:00,792 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 50 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2024-10-11 10:58:00,803 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2024-10-11 10:58:00,803 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 10:58:00,804 INFO  L215           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:58:00,804 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 10:58:00,809 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 10:58:00,809 INFO  L85        PathProgramCache]: Analyzing trace with hash -1370177523, now seen corresponding path program 1 times
[2024-10-11 10:58:00,816 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 10:58:00,817 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097107776]
[2024-10-11 10:58:00,817 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 10:58:00,817 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 10:58:00,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,066 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-11 10:58:01,073 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,079 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-10-11 10:58:01,085 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,091 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-10-11 10:58:01,094 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,100 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-10-11 10:58:01,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,107 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-10-11 10:58:01,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,118 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-10-11 10:58:01,122 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,125 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2024-10-11 10:58:01,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,131 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-10-11 10:58:01,133 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,136 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-10-11 10:58:01,137 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,140 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-10-11 10:58:01,141 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,143 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-10-11 10:58:01,145 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,149 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-10-11 10:58:01,155 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,160 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-10-11 10:58:01,162 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,165 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-10-11 10:58:01,168 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,172 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-10-11 10:58:01,175 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,179 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-10-11 10:58:01,183 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,187 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-10-11 10:58:01,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,194 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-10-11 10:58:01,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,201 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101
[2024-10-11 10:58:01,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,210 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106
[2024-10-11 10:58:01,212 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,215 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-10-11 10:58:01,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,224 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117
[2024-10-11 10:58:01,226 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,232 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2024-10-11 10:58:01,234 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 10:58:01,235 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097107776]
[2024-10-11 10:58:01,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097107776] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 10:58:01,236 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 10:58:01,237 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-11 10:58:01,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016168133]
[2024-10-11 10:58:01,239 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 10:58:01,244 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-10-11 10:58:01,244 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 10:58:01,269 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-10-11 10:58:01,269 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-11 10:58:01,271 INFO  L87              Difference]: Start difference. First operand  has 50 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand  has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22)
[2024-10-11 10:58:01,309 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 10:58:01,310 INFO  L93              Difference]: Finished difference Result 97 states and 174 transitions.
[2024-10-11 10:58:01,312 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-11 10:58:01,313 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 130
[2024-10-11 10:58:01,314 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 10:58:01,338 INFO  L225             Difference]: With dead ends: 97
[2024-10-11 10:58:01,339 INFO  L226             Difference]: Without dead ends: 48
[2024-10-11 10:58:01,346 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-10-11 10:58:01,354 INFO  L432           NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-11 10:58:01,354 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-11 10:58:01,402 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2024-10-11 10:58:01,436 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2024-10-11 10:58:01,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2024-10-11 10:58:01,443 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions.
[2024-10-11 10:58:01,446 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 130
[2024-10-11 10:58:01,447 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 10:58:01,447 INFO  L471      AbstractCegarLoop]: Abstraction has 48 states and 72 transitions.
[2024-10-11 10:58:01,447 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22)
[2024-10-11 10:58:01,448 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 72 transitions.
[2024-10-11 10:58:01,451 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2024-10-11 10:58:01,452 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 10:58:01,452 INFO  L215           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:58:01,452 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-11 10:58:01,453 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 10:58:01,453 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 10:58:01,453 INFO  L85        PathProgramCache]: Analyzing trace with hash -833533619, now seen corresponding path program 1 times
[2024-10-11 10:58:01,454 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 10:58:01,454 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067225384]
[2024-10-11 10:58:01,455 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 10:58:01,455 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 10:58:01,557 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:01,994 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-11 10:58:01,997 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,001 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-10-11 10:58:02,006 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,010 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-10-11 10:58:02,012 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,016 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-10-11 10:58:02,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,020 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-10-11 10:58:02,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,025 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-10-11 10:58:02,026 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,029 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2024-10-11 10:58:02,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,032 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-10-11 10:58:02,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,041 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-10-11 10:58:02,044 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,051 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-10-11 10:58:02,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,055 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-10-11 10:58:02,056 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,058 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-10-11 10:58:02,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,067 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-10-11 10:58:02,070 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,073 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-10-11 10:58:02,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,076 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-10-11 10:58:02,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,080 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-10-11 10:58:02,081 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,083 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-10-11 10:58:02,085 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,087 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-10-11 10:58:02,089 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,092 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101
[2024-10-11 10:58:02,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,096 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106
[2024-10-11 10:58:02,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,113 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-10-11 10:58:02,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,121 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117
[2024-10-11 10:58:02,123 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:02,127 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2024-10-11 10:58:02,128 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 10:58:02,128 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067225384]
[2024-10-11 10:58:02,128 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067225384] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 10:58:02,128 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 10:58:02,128 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-10-11 10:58:02,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480513741]
[2024-10-11 10:58:02,129 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 10:58:02,130 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-10-11 10:58:02,130 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 10:58:02,132 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-10-11 10:58:02,133 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-10-11 10:58:02,134 INFO  L87              Difference]: Start difference. First operand 48 states and 72 transitions. Second operand  has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)
[2024-10-11 10:58:02,431 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 10:58:02,435 INFO  L93              Difference]: Finished difference Result 99 states and 146 transitions.
[2024-10-11 10:58:02,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-10-11 10:58:02,436 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 130
[2024-10-11 10:58:02,437 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 10:58:02,438 INFO  L225             Difference]: With dead ends: 99
[2024-10-11 10:58:02,438 INFO  L226             Difference]: Without dead ends: 52
[2024-10-11 10:58:02,439 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-10-11 10:58:02,440 INFO  L432           NwaCegarLoop]: 64 mSDtfsCounter, 83 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-11 10:58:02,441 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 94 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-11 10:58:02,442 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2024-10-11 10:58:02,457 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52.
[2024-10-11 10:58:02,457 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 52 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2024-10-11 10:58:02,458 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions.
[2024-10-11 10:58:02,459 INFO  L78                 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 130
[2024-10-11 10:58:02,459 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 10:58:02,459 INFO  L471      AbstractCegarLoop]: Abstraction has 52 states and 74 transitions.
[2024-10-11 10:58:02,460 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)
[2024-10-11 10:58:02,460 INFO  L276                IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions.
[2024-10-11 10:58:02,461 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2024-10-11 10:58:02,461 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 10:58:02,462 INFO  L215           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:58:02,462 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-11 10:58:02,462 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 10:58:02,462 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 10:58:02,462 INFO  L85        PathProgramCache]: Analyzing trace with hash -831686577, now seen corresponding path program 1 times
[2024-10-11 10:58:02,463 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 10:58:02,463 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631689280]
[2024-10-11 10:58:02,463 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 10:58:02,463 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 10:58:02,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,847 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-11 10:58:10,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,853 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-10-11 10:58:10,854 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,856 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-10-11 10:58:10,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,859 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-10-11 10:58:10,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,862 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-10-11 10:58:10,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,864 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-10-11 10:58:10,865 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,867 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2024-10-11 10:58:10,868 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,869 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-10-11 10:58:10,871 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,872 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-10-11 10:58:10,874 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,875 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-10-11 10:58:10,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,878 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-10-11 10:58:10,879 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,880 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-10-11 10:58:10,881 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,883 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-10-11 10:58:10,884 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,886 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-10-11 10:58:10,887 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,889 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-10-11 10:58:10,890 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,893 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-10-11 10:58:10,894 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,896 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-10-11 10:58:10,898 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,900 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-10-11 10:58:10,901 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,905 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101
[2024-10-11 10:58:10,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,908 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106
[2024-10-11 10:58:10,913 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,915 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-10-11 10:58:10,916 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,920 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117
[2024-10-11 10:58:10,921 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:10,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2024-10-11 10:58:10,925 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 10:58:10,925 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631689280]
[2024-10-11 10:58:10,926 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631689280] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 10:58:10,926 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 10:58:10,926 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-10-11 10:58:10,926 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56452726]
[2024-10-11 10:58:10,927 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 10:58:10,927 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-10-11 10:58:10,928 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 10:58:10,929 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-10-11 10:58:10,930 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-10-11 10:58:10,930 INFO  L87              Difference]: Start difference. First operand 52 states and 74 transitions. Second operand  has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)
[2024-10-11 10:58:12,020 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 10:58:12,021 INFO  L93              Difference]: Finished difference Result 101 states and 139 transitions.
[2024-10-11 10:58:12,021 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-10-11 10:58:12,021 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 130
[2024-10-11 10:58:12,022 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 10:58:12,027 INFO  L225             Difference]: With dead ends: 101
[2024-10-11 10:58:12,027 INFO  L226             Difference]: Without dead ends: 99
[2024-10-11 10:58:12,028 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210
[2024-10-11 10:58:12,029 INFO  L432           NwaCegarLoop]: 95 mSDtfsCounter, 125 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-10-11 10:58:12,031 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 217 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-10-11 10:58:12,031 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2024-10-11 10:58:12,048 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83.
[2024-10-11 10:58:12,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 45 states have internal predecessors, (48), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34)
[2024-10-11 10:58:12,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 116 transitions.
[2024-10-11 10:58:12,051 INFO  L78                 Accepts]: Start accepts. Automaton has 83 states and 116 transitions. Word has length 130
[2024-10-11 10:58:12,052 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 10:58:12,052 INFO  L471      AbstractCegarLoop]: Abstraction has 83 states and 116 transitions.
[2024-10-11 10:58:12,052 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)
[2024-10-11 10:58:12,052 INFO  L276                IsEmpty]: Start isEmpty. Operand 83 states and 116 transitions.
[2024-10-11 10:58:12,054 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2024-10-11 10:58:12,054 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 10:58:12,054 INFO  L215           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:58:12,054 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-11 10:58:12,055 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 10:58:12,055 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 10:58:12,055 INFO  L85        PathProgramCache]: Analyzing trace with hash 943320785, now seen corresponding path program 1 times
[2024-10-11 10:58:12,055 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 10:58:12,055 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963489596]
[2024-10-11 10:58:12,055 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 10:58:12,056 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 10:58:12,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,523 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-11 10:58:16,525 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,528 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-10-11 10:58:16,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,530 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-10-11 10:58:16,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,533 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-10-11 10:58:16,534 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,535 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-10-11 10:58:16,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,537 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-10-11 10:58:16,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,541 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2024-10-11 10:58:16,543 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,544 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-10-11 10:58:16,546 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,594 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-10-11 10:58:16,596 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,600 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-10-11 10:58:16,602 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,604 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-10-11 10:58:16,605 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,607 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-10-11 10:58:16,608 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,612 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-10-11 10:58:16,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,618 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-10-11 10:58:16,619 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,622 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-10-11 10:58:16,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,626 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-10-11 10:58:16,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,630 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2024-10-11 10:58:16,632 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,636 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-10-11 10:58:16,638 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,641 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101
[2024-10-11 10:58:16,643 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,645 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106
[2024-10-11 10:58:16,647 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,650 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-10-11 10:58:16,651 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,654 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117
[2024-10-11 10:58:16,656 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,659 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked.
[2024-10-11 10:58:16,659 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 10:58:16,659 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963489596]
[2024-10-11 10:58:16,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963489596] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-11 10:58:16,660 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408746354]
[2024-10-11 10:58:16,660 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 10:58:16,660 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-11 10:58:16,660 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3
[2024-10-11 10:58:16,662 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-11 10:58:16,664 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-10-11 10:58:16,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 10:58:16,761 INFO  L255         TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 23 conjuncts are in the unsatisfiable core
[2024-10-11 10:58:16,790 INFO  L278         TraceCheckSpWp]: Computing forward predicates...