./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_loopvsstraightlinecode_100-while_file-97.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version a046e57d
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-97.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 d5e4cb9ac1eb80d849fbfc0dc84b475939efb7668f397b899cd3f0a90b7f4ba1
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m
[2024-10-13 04:04:30,464 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-10-13 04:04:30,538 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-10-13 04:04:30,543 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-10-13 04:04:30,543 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-13 04:04:30,564 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-13 04:04:30,565 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-13 04:04:30,566 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-13 04:04:30,566 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-10-13 04:04:30,567 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-10-13 04:04:30,567 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-13 04:04:30,567 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-13 04:04:30,568 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-13 04:04:30,568 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-10-13 04:04:30,569 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-10-13 04:04:30,570 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-13 04:04:30,570 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-10-13 04:04:30,573 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-10-13 04:04:30,573 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-10-13 04:04:30,573 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-10-13 04:04:30,574 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-10-13 04:04:30,577 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-10-13 04:04:30,577 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-13 04:04:30,577 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-10-13 04:04:30,577 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-10-13 04:04:30,578 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-10-13 04:04:30,578 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-10-13 04:04:30,578 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-10-13 04:04:30,579 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-13 04:04:30,579 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-10-13 04:04:30,579 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-10-13 04:04:30,590 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-10-13 04:04:30,590 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-13 04:04:30,591 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-13 04:04:30,591 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-10-13 04:04:30,591 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-13 04:04:30,592 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-10-13 04:04:30,592 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-13 04:04:30,592 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-13 04:04:30,592 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-13 04:04:30,592 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-10-13 04:04:30,593 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-13 04:04:30,593 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 -> d5e4cb9ac1eb80d849fbfc0dc84b475939efb7668f397b899cd3f0a90b7f4ba1
[2024-10-13 04:04:30,857 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-13 04:04:30,878 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-13 04:04:30,883 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-13 04:04:30,885 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-10-13 04:04:30,886 INFO  L274        PluginConnector]: CDTParser initialized
[2024-10-13 04:04:30,887 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-97.i
[2024-10-13 04:04:32,362 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-10-13 04:04:32,581 INFO  L384              CDTParser]: Found 1 translation units.
[2024-10-13 04:04:32,585 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-97.i
[2024-10-13 04:04:32,603 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31da55594/e8ddeb34ea0348c7b3377ee1e10b9356/FLAGa89b1906b
[2024-10-13 04:04:32,617 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31da55594/e8ddeb34ea0348c7b3377ee1e10b9356
[2024-10-13 04:04:32,619 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-13 04:04:32,621 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-13 04:04:32,625 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-13 04:04:32,625 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-13 04:04:32,630 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-13 04:04:32,631 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:04:32" (1/1) ...
[2024-10-13 04:04:32,632 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bbb045f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:04:32, skipping insertion in model container
[2024-10-13 04:04:32,633 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:04:32" (1/1) ...
[2024-10-13 04:04:32,667 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-10-13 04:04:32,836 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_loopvsstraightlinecode_100-while_file-97.i[916,929]
[2024-10-13 04:04:32,921 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-13 04:04:32,939 INFO  L200         MainTranslator]: Completed pre-run
[2024-10-13 04:04:32,951 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_loopvsstraightlinecode_100-while_file-97.i[916,929]
[2024-10-13 04:04:33,000 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-13 04:04:33,026 INFO  L204         MainTranslator]: Completed translation
[2024-10-13 04:04:33,027 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:04:33 WrapperNode
[2024-10-13 04:04:33,027 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-13 04:04:33,028 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-13 04:04:33,028 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-13 04:04:33,028 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-13 04:04:33,036 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:04:33" (1/1) ...
[2024-10-13 04:04:33,050 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:04:33" (1/1) ...
[2024-10-13 04:04:33,087 INFO  L138                Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184
[2024-10-13 04:04:33,088 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-13 04:04:33,089 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-13 04:04:33,089 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-13 04:04:33,089 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-10-13 04:04:33,101 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:04:33" (1/1) ...
[2024-10-13 04:04:33,101 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:04:33" (1/1) ...
[2024-10-13 04:04:33,107 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:04:33" (1/1) ...
[2024-10-13 04:04:33,142 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-13 04:04:33,143 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:04:33" (1/1) ...
[2024-10-13 04:04:33,143 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:04:33" (1/1) ...
[2024-10-13 04:04:33,161 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:04:33" (1/1) ...
[2024-10-13 04:04:33,165 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:04:33" (1/1) ...
[2024-10-13 04:04:33,168 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:04:33" (1/1) ...
[2024-10-13 04:04:33,171 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:04:33" (1/1) ...
[2024-10-13 04:04:33,178 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-13 04:04:33,184 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-13 04:04:33,185 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-10-13 04:04:33,185 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-10-13 04:04:33,186 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:04:33" (1/1) ...
[2024-10-13 04:04:33,192 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-13 04:04:33,203 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-13 04:04:33,220 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-10-13 04:04:33,224 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-10-13 04:04:33,276 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-13 04:04:33,277 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-10-13 04:04:33,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-10-13 04:04:33,278 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-10-13 04:04:33,278 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-13 04:04:33,279 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-13 04:04:33,376 INFO  L238             CfgBuilder]: Building ICFG
[2024-10-13 04:04:33,379 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-13 04:04:33,788 INFO  L?                        ?]: Removed 22 outVars from TransFormulas that were not future-live.
[2024-10-13 04:04:33,789 INFO  L287             CfgBuilder]: Performing block encoding
[2024-10-13 04:04:33,832 INFO  L309             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-13 04:04:33,832 INFO  L314             CfgBuilder]: Removed 1 assume(true) statements.
[2024-10-13 04:04:33,832 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:04:33 BoogieIcfgContainer
[2024-10-13 04:04:33,833 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-13 04:04:33,835 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-13 04:04:33,835 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-10-13 04:04:33,838 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-10-13 04:04:33,838 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:04:32" (1/3) ...
[2024-10-13 04:04:33,839 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e07ed2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:04:33, skipping insertion in model container
[2024-10-13 04:04:33,839 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:04:33" (2/3) ...
[2024-10-13 04:04:33,840 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e07ed2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:04:33, skipping insertion in model container
[2024-10-13 04:04:33,840 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:04:33" (3/3) ...
[2024-10-13 04:04:33,841 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-97.i
[2024-10-13 04:04:33,858 INFO  L209   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-13 04:04:33,858 INFO  L149   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-10-13 04:04:33,947 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-13 04:04:33,953 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;@50de321c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-13 04:04:33,953 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-10-13 04:04:33,958 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 75 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-10-13 04:04:33,988 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2024-10-13 04:04:33,989 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-13 04:04:33,990 INFO  L215           NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:04:33,991 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 04:04:33,998 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 04:04:33,999 INFO  L85        PathProgramCache]: Analyzing trace with hash 1821303811, now seen corresponding path program 1 times
[2024-10-13 04:04:34,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 04:04:34,009 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112337801]
[2024-10-13 04:04:34,009 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 04:04:34,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 04:04:34,160 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,369 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-13 04:04:34,372 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,381 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-10-13 04:04:34,384 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,390 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-10-13 04:04:34,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,399 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-10-13 04:04:34,403 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,408 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-10-13 04:04:34,410 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,414 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-10-13 04:04:34,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,423 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2024-10-13 04:04:34,425 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,428 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-10-13 04:04:34,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,435 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-10-13 04:04:34,437 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,440 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-10-13 04:04:34,443 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,445 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-10-13 04:04:34,447 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,453 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-10-13 04:04:34,460 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,463 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-10-13 04:04:34,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,470 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-10-13 04:04:34,472 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,475 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-10-13 04:04:34,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,483 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-10-13 04:04:34,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,491 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-10-13 04:04:34,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,497 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-10-13 04:04:34,500 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,502 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-10-13 04:04:34,505 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,508 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-10-13 04:04:34,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,515 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-10-13 04:04:34,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,521 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-10-13 04:04:34,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,527 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-10-13 04:04:34,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,531 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-10-13 04:04:34,534 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked.
[2024-10-13 04:04:34,542 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 04:04:34,542 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112337801]
[2024-10-13 04:04:34,543 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112337801] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 04:04:34,543 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 04:04:34,544 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 04:04:34,545 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916846471]
[2024-10-13 04:04:34,546 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 04:04:34,551 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-10-13 04:04:34,552 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 04:04:34,579 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-10-13 04:04:34,579 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-13 04:04:34,582 INFO  L87              Difference]: Start difference. First operand  has 75 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand  has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24)
[2024-10-13 04:04:34,634 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 04:04:34,635 INFO  L93              Difference]: Finished difference Result 147 states and 264 transitions.
[2024-10-13 04:04:34,637 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-13 04:04:34,639 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 155
[2024-10-13 04:04:34,640 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 04:04:34,649 INFO  L225             Difference]: With dead ends: 147
[2024-10-13 04:04:34,650 INFO  L226             Difference]: Without dead ends: 73
[2024-10-13 04:04:34,655 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-13 04:04:34,658 INFO  L432           NwaCegarLoop]: 113 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, 113 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-13 04:04:34,663 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-13 04:04:34,682 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 73 states.
[2024-10-13 04:04:34,708 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73.
[2024-10-13 04:04:34,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 73 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-10-13 04:04:34,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 116 transitions.
[2024-10-13 04:04:34,714 INFO  L78                 Accepts]: Start accepts. Automaton has 73 states and 116 transitions. Word has length 155
[2024-10-13 04:04:34,714 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-13 04:04:34,714 INFO  L471      AbstractCegarLoop]: Abstraction has 73 states and 116 transitions.
[2024-10-13 04:04:34,715 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24)
[2024-10-13 04:04:34,715 INFO  L276                IsEmpty]: Start isEmpty. Operand 73 states and 116 transitions.
[2024-10-13 04:04:34,720 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2024-10-13 04:04:34,720 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-13 04:04:34,721 INFO  L215           NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:04:34,721 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-13 04:04:34,721 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 04:04:34,722 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 04:04:34,722 INFO  L85        PathProgramCache]: Analyzing trace with hash -1769755653, now seen corresponding path program 1 times
[2024-10-13 04:04:34,722 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 04:04:34,723 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979973770]
[2024-10-13 04:04:34,723 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 04:04:34,724 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 04:04:34,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,969 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-13 04:04:34,971 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,977 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-10-13 04:04:34,978 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,982 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-10-13 04:04:34,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,985 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-10-13 04:04:34,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,989 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-10-13 04:04:34,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:34,999 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-10-13 04:04:35,000 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,002 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2024-10-13 04:04:35,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,006 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-10-13 04:04:35,009 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,012 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-10-13 04:04:35,014 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,017 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-10-13 04:04:35,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,021 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-10-13 04:04:35,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,025 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-10-13 04:04:35,025 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,028 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-10-13 04:04:35,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,033 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-10-13 04:04:35,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,040 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-10-13 04:04:35,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,044 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-10-13 04:04:35,048 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,050 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-10-13 04:04:35,051 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,053 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-10-13 04:04:35,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,056 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-10-13 04:04:35,061 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,063 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-10-13 04:04:35,064 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,069 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-10-13 04:04:35,071 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,072 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-10-13 04:04:35,073 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,076 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-10-13 04:04:35,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,081 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-10-13 04:04:35,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:35,086 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked.
[2024-10-13 04:04:35,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 04:04:35,088 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979973770]
[2024-10-13 04:04:35,089 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979973770] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 04:04:35,089 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 04:04:35,089 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-13 04:04:35,090 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556975037]
[2024-10-13 04:04:35,090 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 04:04:35,092 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-13 04:04:35,093 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 04:04:35,094 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-13 04:04:35,095 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-13 04:04:35,095 INFO  L87              Difference]: Start difference. First operand 73 states and 116 transitions. Second operand  has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)
[2024-10-13 04:04:35,192 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 04:04:35,193 INFO  L93              Difference]: Finished difference Result 208 states and 330 transitions.
[2024-10-13 04:04:35,193 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-13 04:04:35,194 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155
[2024-10-13 04:04:35,195 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 04:04:35,200 INFO  L225             Difference]: With dead ends: 208
[2024-10-13 04:04:35,201 INFO  L226             Difference]: Without dead ends: 136
[2024-10-13 04:04:35,202 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-13 04:04:35,204 INFO  L432           NwaCegarLoop]: 189 mSDtfsCounter, 94 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-13 04:04:35,205 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 289 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-13 04:04:35,206 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 136 states.
[2024-10-13 04:04:35,226 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 83.
[2024-10-13 04:04:35,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 57 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-10-13 04:04:35,229 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 132 transitions.
[2024-10-13 04:04:35,232 INFO  L78                 Accepts]: Start accepts. Automaton has 83 states and 132 transitions. Word has length 155
[2024-10-13 04:04:35,233 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-13 04:04:35,235 INFO  L471      AbstractCegarLoop]: Abstraction has 83 states and 132 transitions.
[2024-10-13 04:04:35,235 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)
[2024-10-13 04:04:35,236 INFO  L276                IsEmpty]: Start isEmpty. Operand 83 states and 132 transitions.
[2024-10-13 04:04:35,238 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2024-10-13 04:04:35,239 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-13 04:04:35,239 INFO  L215           NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:04:35,239 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-13 04:04:35,239 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 04:04:35,240 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 04:04:35,240 INFO  L85        PathProgramCache]: Analyzing trace with hash -1761712083, now seen corresponding path program 1 times
[2024-10-13 04:04:35,241 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 04:04:35,241 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515921751]
[2024-10-13 04:04:35,241 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 04:04:35,241 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 04:04:35,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-10-13 04:04:35,565 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149564022]
[2024-10-13 04:04:35,569 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 04:04:35,569 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-13 04:04:35,569 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-13 04:04:35,571 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-10-13 04:04:35,575 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-10-13 04:04:36,147 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:04:36,150 INFO  L255         TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-10-13 04:04:36,159 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 04:04:37,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 528 proven. 105 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked.
[2024-10-13 04:04:37,043 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-10-13 04:04:41,257 WARN  L851   $PredicateComparison]: unable to prove that (forall ((v_z_6 Int)) (or (< v_z_6 (mod |c_ULTIMATE.start_step_~stepLocal_6~0#1| 256)) (< 65535 v_z_6) (< (mod (div v_z_6 (mod c_~var_1_7~0 4294967296)) 4294967296) v_z_6))) is different from false
[2024-10-13 04:05:15,289 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 04:05:15,290 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515921751]
[2024-10-13 04:05:15,290 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-10-13 04:05:15,294 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149564022]
[2024-10-13 04:05:15,294 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149564022] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-13 04:05:15,294 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2024-10-13 04:05:15,294 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2024-10-13 04:05:15,295 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035367213]
[2024-10-13 04:05:15,295 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2024-10-13 04:05:15,296 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-10-13 04:05:15,296 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 04:05:15,298 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-10-13 04:05:15,298 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=117, Unknown=9, NotChecked=22, Total=182
[2024-10-13 04:05:15,298 INFO  L87              Difference]: Start difference. First operand 83 states and 132 transitions. Second operand  has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24)
[2024-10-13 04:06:08,947 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 04:06:08,948 INFO  L93              Difference]: Finished difference Result 314 states and 470 transitions.
[2024-10-13 04:06:08,948 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2024-10-13 04:06:08,948 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 155
[2024-10-13 04:06:08,949 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 04:06:08,951 INFO  L225             Difference]: With dead ends: 314
[2024-10-13 04:06:08,951 INFO  L226             Difference]: Without dead ends: 232
[2024-10-13 04:06:08,953 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 89.0s TimeCoverageRelationStatistics Valid=310, Invalid=1005, Unknown=21, NotChecked=70, Total=1406
[2024-10-13 04:06:08,954 INFO  L432           NwaCegarLoop]: 73 mSDtfsCounter, 273 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2024-10-13 04:06:08,954 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 322 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2024-10-13 04:06:08,955 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 232 states.
[2024-10-13 04:06:08,985 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 137.
[2024-10-13 04:06:08,986 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 137 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 107 states have internal predecessors, (155), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26)
[2024-10-13 04:06:08,990 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 207 transitions.
[2024-10-13 04:06:08,990 INFO  L78                 Accepts]: Start accepts. Automaton has 137 states and 207 transitions. Word has length 155
[2024-10-13 04:06:08,991 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-13 04:06:08,994 INFO  L471      AbstractCegarLoop]: Abstraction has 137 states and 207 transitions.
[2024-10-13 04:06:08,995 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24)
[2024-10-13 04:06:08,995 INFO  L276                IsEmpty]: Start isEmpty. Operand 137 states and 207 transitions.
[2024-10-13 04:06:08,997 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2024-10-13 04:06:08,997 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-13 04:06:08,997 INFO  L215           NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:06:09,017 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-10-13 04:06:09,198 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-13 04:06:09,199 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 04:06:09,200 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 04:06:09,201 INFO  L85        PathProgramCache]: Analyzing trace with hash -2094702573, now seen corresponding path program 1 times
[2024-10-13 04:06:09,201 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 04:06:09,201 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009934484]
[2024-10-13 04:06:09,201 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 04:06:09,202 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 04:06:09,377 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,020 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-13 04:06:10,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,024 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-10-13 04:06:10,028 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,029 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-10-13 04:06:10,032 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,034 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-10-13 04:06:10,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,036 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-10-13 04:06:10,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,039 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-10-13 04:06:10,040 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,042 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2024-10-13 04:06:10,043 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,044 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-10-13 04:06:10,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,046 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-10-13 04:06:10,047 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,049 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-10-13 04:06:10,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,053 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-10-13 04:06:10,054 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,055 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-10-13 04:06:10,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,059 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-10-13 04:06:10,060 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,061 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-10-13 04:06:10,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,064 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-10-13 04:06:10,065 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,067 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-10-13 04:06:10,069 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,071 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-10-13 04:06:10,072 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,075 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-10-13 04:06:10,076 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,078 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-10-13 04:06:10,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,080 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-10-13 04:06:10,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,242 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-10-13 04:06:10,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,246 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-10-13 04:06:10,248 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,250 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-10-13 04:06:10,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,256 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-10-13 04:06:10,258 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked.
[2024-10-13 04:06:10,261 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 04:06:10,264 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009934484]
[2024-10-13 04:06:10,264 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009934484] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-13 04:06:10,264 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310167322]
[2024-10-13 04:06:10,266 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 04:06:10,267 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-13 04:06:10,267 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-13 04:06:10,269 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-13 04:06:10,270 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-10-13 04:06:10,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 04:06:10,397 INFO  L255         TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-10-13 04:06:10,401 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 04:06:11,285 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked.
[2024-10-13 04:06:11,286 INFO  L311         TraceCheckSpWp]: Computing backward predicates...