./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 61a67961
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-wip.fs.cvc5-61a6796-m
[2024-10-14 11:31:30,076 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-10-14 11:31:30,153 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-10-14 11:31:30,159 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-10-14 11:31:30,160 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-14 11:31:30,191 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-14 11:31:30,192 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-14 11:31:30,192 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-14 11:31:30,193 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-10-14 11:31:30,194 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-10-14 11:31:30,194 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-14 11:31:30,195 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-14 11:31:30,195 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-14 11:31:30,196 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-10-14 11:31:30,196 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-10-14 11:31:30,197 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-14 11:31:30,199 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-10-14 11:31:30,199 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-10-14 11:31:30,199 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-10-14 11:31:30,200 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-10-14 11:31:30,201 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-10-14 11:31:30,201 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-10-14 11:31:30,202 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-14 11:31:30,202 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-10-14 11:31:30,203 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-10-14 11:31:30,203 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-10-14 11:31:30,204 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-10-14 11:31:30,204 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-10-14 11:31:30,204 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-14 11:31:30,205 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-10-14 11:31:30,205 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-10-14 11:31:30,205 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-10-14 11:31:30,205 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-14 11:31:30,206 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-14 11:31:30,206 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-10-14 11:31:30,207 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-14 11:31:30,208 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-10-14 11:31:30,208 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-14 11:31:30,208 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-14 11:31:30,208 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-14 11:31:30,208 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-10-14 11:31:30,209 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-14 11:31:30,209 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-14 11:31:30,503 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-14 11:31:30,529 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-14 11:31:30,532 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-14 11:31:30,533 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-10-14 11:31:30,534 INFO  L274        PluginConnector]: CDTParser initialized
[2024-10-14 11:31:30,535 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-14 11:31:31,982 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-10-14 11:31:32,191 INFO  L384              CDTParser]: Found 1 translation units.
[2024-10-14 11:31:32,194 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-97.i
[2024-10-14 11:31:32,204 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8c5f40a4/fc552fab96dd4a97b4d0a28528c37b8a/FLAG859c1d895
[2024-10-14 11:31:32,217 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8c5f40a4/fc552fab96dd4a97b4d0a28528c37b8a
[2024-10-14 11:31:32,220 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-14 11:31:32,221 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-14 11:31:32,224 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-14 11:31:32,226 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-14 11:31:32,231 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-14 11:31:32,232 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:31:32" (1/1) ...
[2024-10-14 11:31:32,233 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4f2cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:31:32, skipping insertion in model container
[2024-10-14 11:31:32,233 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:31:32" (1/1) ...
[2024-10-14 11:31:32,270 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-10-14 11:31:32,412 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-14 11:31:32,512 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-14 11:31:32,526 INFO  L200         MainTranslator]: Completed pre-run
[2024-10-14 11:31:32,541 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-14 11:31:32,592 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-14 11:31:32,610 INFO  L204         MainTranslator]: Completed translation
[2024-10-14 11:31:32,611 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:31:32 WrapperNode
[2024-10-14 11:31:32,611 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-14 11:31:32,612 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-14 11:31:32,612 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-14 11:31:32,613 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-14 11:31:32,621 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:31:32" (1/1) ...
[2024-10-14 11:31:32,636 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:31:32" (1/1) ...
[2024-10-14 11:31:32,677 INFO  L138                Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184
[2024-10-14 11:31:32,677 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-14 11:31:32,678 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-14 11:31:32,678 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-14 11:31:32,678 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-10-14 11:31:32,691 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:31:32" (1/1) ...
[2024-10-14 11:31:32,691 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:31:32" (1/1) ...
[2024-10-14 11:31:32,695 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:31:32" (1/1) ...
[2024-10-14 11:31:32,716 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-14 11:31:32,716 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:31:32" (1/1) ...
[2024-10-14 11:31:32,717 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:31:32" (1/1) ...
[2024-10-14 11:31:32,736 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:31:32" (1/1) ...
[2024-10-14 11:31:32,740 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:31:32" (1/1) ...
[2024-10-14 11:31:32,744 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:31:32" (1/1) ...
[2024-10-14 11:31:32,747 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:31:32" (1/1) ...
[2024-10-14 11:31:32,753 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-14 11:31:32,757 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-14 11:31:32,757 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-10-14 11:31:32,757 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-10-14 11:31:32,758 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:31:32" (1/1) ...
[2024-10-14 11:31:32,772 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-14 11:31:32,789 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-14 11:31:32,805 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-14 11:31:32,808 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-14 11:31:32,857 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-14 11:31:32,857 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-10-14 11:31:32,858 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-10-14 11:31:32,858 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-10-14 11:31:32,858 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-14 11:31:32,859 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-14 11:31:32,960 INFO  L238             CfgBuilder]: Building ICFG
[2024-10-14 11:31:32,962 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-14 11:31:33,407 INFO  L?                        ?]: Removed 22 outVars from TransFormulas that were not future-live.
[2024-10-14 11:31:33,408 INFO  L287             CfgBuilder]: Performing block encoding
[2024-10-14 11:31:33,457 INFO  L309             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-14 11:31:33,457 INFO  L314             CfgBuilder]: Removed 1 assume(true) statements.
[2024-10-14 11:31:33,457 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:31:33 BoogieIcfgContainer
[2024-10-14 11:31:33,458 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-14 11:31:33,460 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-14 11:31:33,461 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-10-14 11:31:33,464 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-10-14 11:31:33,465 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:31:32" (1/3) ...
[2024-10-14 11:31:33,466 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bf0387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:31:33, skipping insertion in model container
[2024-10-14 11:31:33,466 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:31:32" (2/3) ...
[2024-10-14 11:31:33,467 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bf0387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:31:33, skipping insertion in model container
[2024-10-14 11:31:33,467 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:31:33" (3/3) ...
[2024-10-14 11:31:33,468 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-97.i
[2024-10-14 11:31:33,488 INFO  L209   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-14 11:31:33,488 INFO  L149   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-10-14 11:31:33,564 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-14 11:31:33,571 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;@5f0953f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-14 11:31:33,572 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-10-14 11:31:33,576 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-14 11:31:33,590 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2024-10-14 11:31:33,591 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-14 11:31:33,592 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-14 11:31:33,593 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-14 11:31:33,598 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-14 11:31:33,599 INFO  L85        PathProgramCache]: Analyzing trace with hash 1821303811, now seen corresponding path program 1 times
[2024-10-14 11:31:33,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-14 11:31:33,608 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454757073]
[2024-10-14 11:31:33,608 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-14 11:31:33,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-14 11:31:33,747 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:33,902 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-14 11:31:33,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:33,914 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-10-14 11:31:33,916 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:33,919 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-10-14 11:31:33,921 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:33,924 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-10-14 11:31:33,925 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:33,927 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-10-14 11:31:33,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:33,931 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-10-14 11:31:33,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:33,934 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2024-10-14 11:31:33,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:33,939 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-10-14 11:31:33,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:33,943 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-10-14 11:31:33,945 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:33,947 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-10-14 11:31:33,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:33,952 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-10-14 11:31:33,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:33,960 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-10-14 11:31:33,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:33,968 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-10-14 11:31:33,974 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:33,980 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-10-14 11:31:33,981 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:33,987 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-10-14 11:31:33,991 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:33,994 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-10-14 11:31:33,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,003 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-10-14 11:31:34,006 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,009 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-10-14 11:31:34,012 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,014 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-10-14 11:31:34,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,020 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-10-14 11:31:34,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,027 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-10-14 11:31:34,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,033 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-10-14 11:31:34,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,041 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-10-14 11:31:34,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,044 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-10-14 11:31:34,046 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,053 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-14 11:31:34,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-14 11:31:34,055 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454757073]
[2024-10-14 11:31:34,056 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454757073] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-14 11:31:34,057 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-14 11:31:34,057 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-14 11:31:34,059 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784930904]
[2024-10-14 11:31:34,060 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-14 11:31:34,064 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-10-14 11:31:34,065 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-14 11:31:34,090 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-10-14 11:31:34,091 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-14 11:31:34,094 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-14 11:31:34,139 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-14 11:31:34,140 INFO  L93              Difference]: Finished difference Result 147 states and 264 transitions.
[2024-10-14 11:31:34,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-14 11:31:34,142 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-14 11:31:34,143 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-14 11:31:34,150 INFO  L225             Difference]: With dead ends: 147
[2024-10-14 11:31:34,151 INFO  L226             Difference]: Without dead ends: 73
[2024-10-14 11:31:34,156 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-14 11:31:34,179 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-14 11:31:34,182 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-14 11:31:34,200 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 73 states.
[2024-10-14 11:31:34,252 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73.
[2024-10-14 11:31:34,253 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-14 11:31:34,255 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 116 transitions.
[2024-10-14 11:31:34,256 INFO  L78                 Accepts]: Start accepts. Automaton has 73 states and 116 transitions. Word has length 155
[2024-10-14 11:31:34,257 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-14 11:31:34,257 INFO  L471      AbstractCegarLoop]: Abstraction has 73 states and 116 transitions.
[2024-10-14 11:31:34,257 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-14 11:31:34,257 INFO  L276                IsEmpty]: Start isEmpty. Operand 73 states and 116 transitions.
[2024-10-14 11:31:34,264 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2024-10-14 11:31:34,264 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-14 11:31:34,265 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-14 11:31:34,265 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-14 11:31:34,265 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-14 11:31:34,267 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-14 11:31:34,267 INFO  L85        PathProgramCache]: Analyzing trace with hash -1769755653, now seen corresponding path program 1 times
[2024-10-14 11:31:34,267 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-14 11:31:34,267 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807702287]
[2024-10-14 11:31:34,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-14 11:31:34,268 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-14 11:31:34,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,501 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-14 11:31:34,503 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,505 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-10-14 11:31:34,507 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,510 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-10-14 11:31:34,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,513 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-10-14 11:31:34,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,517 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-10-14 11:31:34,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,524 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-10-14 11:31:34,525 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,527 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2024-10-14 11:31:34,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,531 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-10-14 11:31:34,533 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,536 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-10-14 11:31:34,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,540 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-10-14 11:31:34,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,543 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-10-14 11:31:34,547 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,548 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-10-14 11:31:34,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,555 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-10-14 11:31:34,559 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,561 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-10-14 11:31:34,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,564 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-10-14 11:31:34,565 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,568 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-10-14 11:31:34,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,574 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-10-14 11:31:34,579 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,581 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-10-14 11:31:34,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,585 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-10-14 11:31:34,588 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,589 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-10-14 11:31:34,592 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,595 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-10-14 11:31:34,599 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,600 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-10-14 11:31:34,602 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,603 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-10-14 11:31:34,606 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,608 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-10-14 11:31:34,610 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:34,615 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-14 11:31:34,615 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-14 11:31:34,615 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807702287]
[2024-10-14 11:31:34,616 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807702287] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-14 11:31:34,616 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-14 11:31:34,616 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-14 11:31:34,616 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142812363]
[2024-10-14 11:31:34,616 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-14 11:31:34,618 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-14 11:31:34,619 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-14 11:31:34,620 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-14 11:31:34,621 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-14 11:31:34,622 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-14 11:31:34,735 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-14 11:31:34,736 INFO  L93              Difference]: Finished difference Result 208 states and 330 transitions.
[2024-10-14 11:31:34,736 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-14 11:31:34,737 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-14 11:31:34,738 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-14 11:31:34,741 INFO  L225             Difference]: With dead ends: 208
[2024-10-14 11:31:34,744 INFO  L226             Difference]: Without dead ends: 136
[2024-10-14 11:31:34,745 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-14 11:31:34,746 INFO  L432           NwaCegarLoop]: 189 mSDtfsCounter, 94 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 11:31:34,747 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-14 11:31:34,748 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 136 states.
[2024-10-14 11:31:34,767 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 83.
[2024-10-14 11:31:34,767 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-14 11:31:34,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 132 transitions.
[2024-10-14 11:31:34,770 INFO  L78                 Accepts]: Start accepts. Automaton has 83 states and 132 transitions. Word has length 155
[2024-10-14 11:31:34,773 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-14 11:31:34,774 INFO  L471      AbstractCegarLoop]: Abstraction has 83 states and 132 transitions.
[2024-10-14 11:31:34,775 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-14 11:31:34,775 INFO  L276                IsEmpty]: Start isEmpty. Operand 83 states and 132 transitions.
[2024-10-14 11:31:34,777 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2024-10-14 11:31:34,780 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-14 11:31:34,780 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-14 11:31:34,780 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-14 11:31:34,780 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-14 11:31:34,781 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-14 11:31:34,781 INFO  L85        PathProgramCache]: Analyzing trace with hash -1761712083, now seen corresponding path program 1 times
[2024-10-14 11:31:34,781 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-14 11:31:34,782 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239076010]
[2024-10-14 11:31:34,782 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-14 11:31:34,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-14 11:31:35,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-10-14 11:31:35,092 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [449461595]
[2024-10-14 11:31:35,096 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-14 11:31:35,096 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-14 11:31:35,096 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-14 11:31:35,098 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-14 11:31:35,100 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-14 11:31:35,684 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:31:35,687 INFO  L255         TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-10-14 11:31:35,696 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-14 11:31:36,577 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-14 11:31:36,580 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-10-14 11:31:40,802 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-14 11:32:06,227 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-14 11:32:06,227 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239076010]
[2024-10-14 11:32:06,228 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-10-14 11:32:06,228 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449461595]
[2024-10-14 11:32:06,228 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [449461595] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-14 11:32:06,228 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2024-10-14 11:32:06,228 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2024-10-14 11:32:06,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959173349]
[2024-10-14 11:32:06,229 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2024-10-14 11:32:06,229 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-10-14 11:32:06,229 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-14 11:32:06,230 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-10-14 11:32:06,230 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=119, Unknown=7, NotChecked=22, Total=182
[2024-10-14 11:32:06,231 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-14 11:32:36,143 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-14 11:32:36,143 INFO  L93              Difference]: Finished difference Result 314 states and 470 transitions.
[2024-10-14 11:32:36,144 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2024-10-14 11:32:36,144 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-14 11:32:36,145 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-14 11:32:36,147 INFO  L225             Difference]: With dead ends: 314
[2024-10-14 11:32:36,147 INFO  L226             Difference]: Without dead ends: 232
[2024-10-14 11:32:36,149 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 56.4s TimeCoverageRelationStatistics Valid=310, Invalid=1013, Unknown=13, NotChecked=70, Total=1406
[2024-10-14 11:32:36,150 INFO  L432           NwaCegarLoop]: 73 mSDtfsCounter, 273 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.6s IncrementalHoareTripleChecker+Time
[2024-10-14 11:32:36,150 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.6s Time]
[2024-10-14 11:32:36,151 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 232 states.
[2024-10-14 11:32:36,177 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 137.
[2024-10-14 11:32:36,178 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-14 11:32:36,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 207 transitions.
[2024-10-14 11:32:36,181 INFO  L78                 Accepts]: Start accepts. Automaton has 137 states and 207 transitions. Word has length 155
[2024-10-14 11:32:36,182 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-14 11:32:36,186 INFO  L471      AbstractCegarLoop]: Abstraction has 137 states and 207 transitions.
[2024-10-14 11:32:36,186 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-14 11:32:36,187 INFO  L276                IsEmpty]: Start isEmpty. Operand 137 states and 207 transitions.
[2024-10-14 11:32:36,189 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2024-10-14 11:32:36,192 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-14 11:32:36,192 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-14 11:32:36,212 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-10-14 11:32:36,393 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-14 11:32:36,394 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-14 11:32:36,394 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-14 11:32:36,394 INFO  L85        PathProgramCache]: Analyzing trace with hash -2094702573, now seen corresponding path program 1 times
[2024-10-14 11:32:36,395 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-14 11:32:36,395 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029118574]
[2024-10-14 11:32:36,395 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-14 11:32:36,395 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-14 11:32:36,546 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,077 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-14 11:32:37,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,079 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-10-14 11:32:37,080 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,081 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-10-14 11:32:37,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,083 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-10-14 11:32:37,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,085 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-10-14 11:32:37,086 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,087 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-10-14 11:32:37,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,088 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2024-10-14 11:32:37,089 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,090 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-10-14 11:32:37,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,091 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-10-14 11:32:37,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,093 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-10-14 11:32:37,094 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,095 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-10-14 11:32:37,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,096 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-10-14 11:32:37,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,098 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-10-14 11:32:37,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,100 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-10-14 11:32:37,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,101 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-10-14 11:32:37,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,103 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-10-14 11:32:37,104 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,105 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-10-14 11:32:37,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,107 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-10-14 11:32:37,107 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,108 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-10-14 11:32:37,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,110 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-10-14 11:32:37,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,221 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-10-14 11:32:37,223 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,225 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-10-14 11:32:37,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,229 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-10-14 11:32:37,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,233 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-10-14 11:32:37,235 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,238 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-14 11:32:37,238 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-14 11:32:37,238 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029118574]
[2024-10-14 11:32:37,238 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029118574] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-14 11:32:37,239 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814908430]
[2024-10-14 11:32:37,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-14 11:32:37,239 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-14 11:32:37,239 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-14 11:32:37,245 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-14 11:32:37,247 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-14 11:32:37,378 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:37,380 INFO  L255         TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-10-14 11:32:37,384 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-14 11:32:37,953 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-14 11:32:37,953 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-10-14 11:32:39,049 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-14 11:32:39,050 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814908430] provided 0 perfect and 2 imperfect interpolant sequences
[2024-10-14 11:32:39,050 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-10-14 11:32:39,050 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11
[2024-10-14 11:32:39,050 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256293115]
[2024-10-14 11:32:39,051 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-10-14 11:32:39,052 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-10-14 11:32:39,052 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-14 11:32:39,052 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-10-14 11:32:39,053 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-10-14 11:32:39,053 INFO  L87              Difference]: Start difference. First operand 137 states and 207 transitions. Second operand  has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29)
[2024-10-14 11:32:42,223 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-14 11:32:42,224 INFO  L93              Difference]: Finished difference Result 431 states and 622 transitions.
[2024-10-14 11:32:42,225 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2024-10-14 11:32:42,225 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 156
[2024-10-14 11:32:42,225 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-14 11:32:42,229 INFO  L225             Difference]: With dead ends: 431
[2024-10-14 11:32:42,229 INFO  L226             Difference]: Without dead ends: 295
[2024-10-14 11:32:42,230 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 355 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756
[2024-10-14 11:32:42,231 INFO  L432           NwaCegarLoop]: 110 mSDtfsCounter, 208 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2024-10-14 11:32:42,232 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 446 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2024-10-14 11:32:42,233 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 295 states.
[2024-10-14 11:32:42,280 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 209.
[2024-10-14 11:32:42,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 209 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 156 states have internal predecessors, (209), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46)
[2024-10-14 11:32:42,286 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 301 transitions.
[2024-10-14 11:32:42,287 INFO  L78                 Accepts]: Start accepts. Automaton has 209 states and 301 transitions. Word has length 156
[2024-10-14 11:32:42,288 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-14 11:32:42,288 INFO  L471      AbstractCegarLoop]: Abstraction has 209 states and 301 transitions.
[2024-10-14 11:32:42,288 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29)
[2024-10-14 11:32:42,288 INFO  L276                IsEmpty]: Start isEmpty. Operand 209 states and 301 transitions.
[2024-10-14 11:32:42,292 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2024-10-14 11:32:42,294 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-14 11:32:42,294 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-14 11:32:42,314 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-10-14 11:32:42,494 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3
[2024-10-14 11:32:42,495 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-14 11:32:42,496 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-14 11:32:42,496 INFO  L85        PathProgramCache]: Analyzing trace with hash -2086659003, now seen corresponding path program 1 times
[2024-10-14 11:32:42,496 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-14 11:32:42,496 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312754350]
[2024-10-14 11:32:42,496 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-14 11:32:42,496 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-14 11:32:42,626 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-10-14 11:32:42,630 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112916484]
[2024-10-14 11:32:42,630 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-14 11:32:42,631 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-14 11:32:42,631 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-14 11:32:42,634 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-14 11:32:42,635 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-10-14 11:32:43,459 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-14 11:32:43,462 INFO  L255         TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 39 conjuncts are in the unsatisfiable core
[2024-10-14 11:32:43,467 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-14 11:32:50,785 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 442 proven. 234 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked.
[2024-10-14 11:32:50,786 INFO  L311         TraceCheckSpWp]: Computing backward predicates...