./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-97.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 023d838f
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_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 0bd598c6ab4eb0f85d075cd68c94871d585d0d9cc55a581ea912a4da97c7f3b7
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m
[2024-11-10 07:09:59,202 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-10 07:09:59,250 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-10 07:09:59,264 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-10 07:09:59,264 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-10 07:09:59,299 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-10 07:09:59,301 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-10 07:09:59,301 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-10 07:09:59,302 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-10 07:09:59,305 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-10 07:09:59,305 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-10 07:09:59,305 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-10 07:09:59,306 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-10 07:09:59,306 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-10 07:09:59,306 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-10 07:09:59,306 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-10 07:09:59,306 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-10 07:09:59,306 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-10 07:09:59,306 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-10 07:09:59,307 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-10 07:09:59,307 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-10 07:09:59,309 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-10 07:09:59,309 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-10 07:09:59,309 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-10 07:09:59,309 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-10 07:09:59,310 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-10 07:09:59,310 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-10 07:09:59,310 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-10 07:09:59,310 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-10 07:09:59,310 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-10 07:09:59,310 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-10 07:09:59,311 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-10 07:09:59,311 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-10 07:09:59,311 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-10 07:09:59,312 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-10 07:09:59,312 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-10 07:09:59,312 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-10 07:09:59,312 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-10 07:09:59,312 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-10 07:09:59,313 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-10 07:09:59,313 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-10 07:09:59,313 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-10 07:09:59,313 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 -> 0bd598c6ab4eb0f85d075cd68c94871d585d0d9cc55a581ea912a4da97c7f3b7
[2024-11-10 07:09:59,514 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-10 07:09:59,559 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-10 07:09:59,566 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-10 07:09:59,568 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-10 07:09:59,572 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-10 07:09:59,573 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-97.i
[2024-11-10 07:10:01,108 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-10 07:10:01,295 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-10 07:10:01,296 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-97.i
[2024-11-10 07:10:01,303 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61731b6bc/5ed9ca21acd243239d76e4bd06bfef0e/FLAG39317d002
[2024-11-10 07:10:01,314 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61731b6bc/5ed9ca21acd243239d76e4bd06bfef0e
[2024-11-10 07:10:01,316 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-10 07:10:01,317 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-10 07:10:01,318 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-10 07:10:01,318 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-10 07:10:01,326 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-10 07:10:01,327 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:10:01" (1/1) ...
[2024-11-10 07:10:01,327 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e04cf54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01, skipping insertion in model container
[2024-11-10 07:10:01,328 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:10:01" (1/1) ...
[2024-11-10 07:10:01,354 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-10 07:10:01,497 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-97.i[916,929]
[2024-11-10 07:10:01,599 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-10 07:10:01,611 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-10 07:10:01,627 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-97.i[916,929]
[2024-11-10 07:10:01,675 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-10 07:10:01,699 INFO  L204         MainTranslator]: Completed translation
[2024-11-10 07:10:01,702 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01 WrapperNode
[2024-11-10 07:10:01,703 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-10 07:10:01,704 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-10 07:10:01,705 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-10 07:10:01,705 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-10 07:10:01,711 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ...
[2024-11-10 07:10:01,721 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ...
[2024-11-10 07:10:01,805 INFO  L138                Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188
[2024-11-10 07:10:01,806 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-10 07:10:01,807 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-10 07:10:01,807 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-10 07:10:01,812 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-10 07:10:01,825 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ...
[2024-11-10 07:10:01,825 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ...
[2024-11-10 07:10:01,849 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ...
[2024-11-10 07:10:01,879 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-10 07:10:01,879 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ...
[2024-11-10 07:10:01,879 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ...
[2024-11-10 07:10:01,892 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ...
[2024-11-10 07:10:01,896 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ...
[2024-11-10 07:10:01,902 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ...
[2024-11-10 07:10:01,904 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ...
[2024-11-10 07:10:01,909 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-10 07:10:01,911 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2024-11-10 07:10:01,911 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2024-11-10 07:10:01,911 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2024-11-10 07:10:01,912 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ...
[2024-11-10 07:10:01,916 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-10 07:10:01,926 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-10 07:10:01,955 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-10 07:10:01,965 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-10 07:10:02,022 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-10 07:10:02,022 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-10 07:10:02,024 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-10 07:10:02,024 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-10 07:10:02,024 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-10 07:10:02,024 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-10 07:10:02,109 INFO  L256             CfgBuilder]: Building ICFG
[2024-11-10 07:10:02,111 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-10 07:10:02,466 INFO  L?                        ?]: Removed 23 outVars from TransFormulas that were not future-live.
[2024-11-10 07:10:02,466 INFO  L307             CfgBuilder]: Performing block encoding
[2024-11-10 07:10:02,485 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-10 07:10:02,486 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-10 07:10:02,486 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:10:02 BoogieIcfgContainer
[2024-11-10 07:10:02,486 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2024-11-10 07:10:02,489 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-10 07:10:02,490 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-10 07:10:02,494 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-10 07:10:02,494 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:10:01" (1/3) ...
[2024-11-10 07:10:02,495 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37094ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:10:02, skipping insertion in model container
[2024-11-10 07:10:02,495 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (2/3) ...
[2024-11-10 07:10:02,496 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37094ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:10:02, skipping insertion in model container
[2024-11-10 07:10:02,496 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:10:02" (3/3) ...
[2024-11-10 07:10:02,498 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-97.i
[2024-11-10 07:10:02,518 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-10 07:10:02,518 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-10 07:10:02,581 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-10 07:10:02,587 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;@30357d08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-10 07:10:02,587 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-10 07:10:02,592 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 84 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 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-11-10 07:10:02,606 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2024-11-10 07:10:02,606 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-10 07:10:02,607 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, 1, 1, 1, 1, 1]
[2024-11-10 07:10:02,608 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-10 07:10:02,612 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 07:10:02,613 INFO  L85        PathProgramCache]: Analyzing trace with hash 609625573, now seen corresponding path program 1 times
[2024-11-10 07:10:02,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 07:10:02,623 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091213340]
[2024-11-10 07:10:02,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 07:10:02,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 07:10:02,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:02,984 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2024-11-10 07:10:02,987 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:02,992 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-10 07:10:02,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,003 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-10 07:10:03,009 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,020 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-10 07:10:03,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,026 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-10 07:10:03,028 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,031 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-10 07:10:03,032 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,033 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-10 07:10:03,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,038 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-10 07:10:03,041 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,044 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-10 07:10:03,046 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,048 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-10 07:10:03,051 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,052 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-10 07:10:03,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,054 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-10 07:10:03,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,057 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-10 07:10:03,058 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,062 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-10 07:10:03,063 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,069 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-10 07:10:03,070 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,071 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-10 07:10:03,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,076 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-11-10 07:10:03,080 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,082 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101
[2024-11-10 07:10:03,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,087 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-10 07:10:03,089 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,090 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-10 07:10:03,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,095 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-10 07:10:03,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,098 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-10 07:10:03,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,105 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129
[2024-11-10 07:10:03,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,107 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134
[2024-11-10 07:10:03,110 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,118 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked.
[2024-11-10 07:10:03,118 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 07:10:03,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091213340]
[2024-11-10 07:10:03,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091213340] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 07:10:03,119 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 07:10:03,120 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-10 07:10:03,121 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597559152]
[2024-11-10 07:10:03,122 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 07:10:03,126 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-10 07:10:03,126 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 07:10:03,150 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-10 07:10:03,151 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-10 07:10:03,153 INFO  L87              Difference]: Start difference. First operand  has 84 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 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 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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-11-10 07:10:03,184 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-10 07:10:03,184 INFO  L93              Difference]: Finished difference Result 164 states and 280 transitions.
[2024-11-10 07:10:03,185 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-10 07:10:03,186 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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 161
[2024-11-10 07:10:03,187 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-10 07:10:03,235 INFO  L225             Difference]: With dead ends: 164
[2024-11-10 07:10:03,235 INFO  L226             Difference]: Without dead ends: 79
[2024-11-10 07:10:03,245 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-11-10 07:10:03,250 INFO  L432           NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-10 07:10:03,252 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-10 07:10:03,318 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2024-11-10 07:10:03,360 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79.
[2024-11-10 07:10:03,362 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 79 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 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-11-10 07:10:03,363 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions.
[2024-11-10 07:10:03,366 INFO  L78                 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 161
[2024-11-10 07:10:03,367 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-10 07:10:03,367 INFO  L471      AbstractCegarLoop]: Abstraction has 79 states and 122 transitions.
[2024-11-10 07:10:03,367 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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-11-10 07:10:03,368 INFO  L276                IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions.
[2024-11-10 07:10:03,371 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2024-11-10 07:10:03,371 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-10 07:10:03,372 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, 1, 1, 1, 1, 1]
[2024-11-10 07:10:03,372 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-10 07:10:03,372 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-10 07:10:03,372 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 07:10:03,373 INFO  L85        PathProgramCache]: Analyzing trace with hash 1682406113, now seen corresponding path program 1 times
[2024-11-10 07:10:03,373 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 07:10:03,373 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572010835]
[2024-11-10 07:10:03,374 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 07:10:03,374 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 07:10:03,444 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,528 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2024-11-10 07:10:03,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,530 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-10 07:10:03,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,532 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-10 07:10:03,533 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,534 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-10 07:10:03,535 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,536 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-10 07:10:03,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,538 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-10 07:10:03,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,539 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-10 07:10:03,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,541 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-10 07:10:03,542 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,543 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-10 07:10:03,544 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,545 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-10 07:10:03,546 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,547 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-10 07:10:03,547 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,548 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-10 07:10:03,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,551 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-10 07:10:03,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,553 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-10 07:10:03,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,554 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-10 07:10:03,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,556 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-10 07:10:03,557 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,558 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-11-10 07:10:03,559 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,560 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101
[2024-11-10 07:10:03,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,562 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-10 07:10:03,563 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,564 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-10 07:10:03,564 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,566 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-10 07:10:03,566 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,567 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-10 07:10:03,568 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,569 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129
[2024-11-10 07:10:03,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,571 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134
[2024-11-10 07:10:03,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:03,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked.
[2024-11-10 07:10:03,574 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 07:10:03,574 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572010835]
[2024-11-10 07:10:03,574 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572010835] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 07:10:03,574 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 07:10:03,575 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-10 07:10:03,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441331668]
[2024-11-10 07:10:03,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 07:10:03,576 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-10 07:10:03,578 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 07:10:03,579 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-10 07:10:03,579 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-10 07:10:03,580 INFO  L87              Difference]: Start difference. First operand 79 states and 122 transitions. Second operand  has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-11-10 07:10:03,675 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-10 07:10:03,675 INFO  L93              Difference]: Finished difference Result 222 states and 344 transitions.
[2024-11-10 07:10:03,675 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-10 07:10:03,675 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 161
[2024-11-10 07:10:03,676 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-10 07:10:03,678 INFO  L225             Difference]: With dead ends: 222
[2024-11-10 07:10:03,678 INFO  L226             Difference]: Without dead ends: 146
[2024-11-10 07:10:03,679 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-11-10 07:10:03,679 INFO  L432           NwaCegarLoop]: 199 mSDtfsCounter, 98 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-10 07:10:03,680 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 305 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-10 07:10:03,680 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 146 states.
[2024-11-10 07:10:03,692 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 89.
[2024-11-10 07:10:03,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 89 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 63 states have internal predecessors, (90), 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-11-10 07:10:03,694 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions.
[2024-11-10 07:10:03,694 INFO  L78                 Accepts]: Start accepts. Automaton has 89 states and 138 transitions. Word has length 161
[2024-11-10 07:10:03,695 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-10 07:10:03,695 INFO  L471      AbstractCegarLoop]: Abstraction has 89 states and 138 transitions.
[2024-11-10 07:10:03,696 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-11-10 07:10:03,696 INFO  L276                IsEmpty]: Start isEmpty. Operand 89 states and 138 transitions.
[2024-11-10 07:10:03,697 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2024-11-10 07:10:03,697 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-10 07:10:03,697 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, 1, 1, 1, 1, 1]
[2024-11-10 07:10:03,698 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-10 07:10:03,698 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-10 07:10:03,698 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 07:10:03,698 INFO  L85        PathProgramCache]: Analyzing trace with hash -1553282596, now seen corresponding path program 1 times
[2024-11-10 07:10:03,698 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 07:10:03,699 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898303927]
[2024-11-10 07:10:03,699 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 07:10:03,699 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 07:10:03,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-10 07:10:04,002 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [253403476]
[2024-11-10 07:10:04,006 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 07:10:04,006 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-10 07:10:04,007 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-10 07:10:04,008 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-10 07:10:04,010 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-10 07:10:04,674 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:10:04,677 INFO  L255         TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-11-10 07:10:04,686 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-10 07:10:05,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 528 proven. 105 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked.
[2024-11-10 07:10:05,566 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-10 07:10:35,841 WARN  L851   $PredicateComparison]: unable to prove that (forall ((v_z_6 Int)) (or (< v_z_6 (mod c_~var_1_14~0 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-11-10 07:10:36,501 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 07:10:36,503 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898303927]
[2024-11-10 07:10:36,503 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-10 07:10:36,503 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253403476]
[2024-11-10 07:10:36,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [253403476] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-10 07:10:36,504 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2024-11-10 07:10:36,504 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2024-11-10 07:10:36,504 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472354918]
[2024-11-10 07:10:36,504 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2024-11-10 07:10:36,505 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-10 07:10:36,505 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 07:10:36,506 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-10 07:10:36,506 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=119, Unknown=7, NotChecked=22, Total=182
[2024-11-10 07:10:36,506 INFO  L87              Difference]: Start difference. First operand 89 states and 138 transitions. Second operand  has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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-11-10 07:11:10,009 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-10 07:11:10,011 INFO  L93              Difference]: Finished difference Result 336 states and 492 transitions.
[2024-11-10 07:11:10,012 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2024-11-10 07:11:10,012 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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 161
[2024-11-10 07:11:10,013 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-10 07:11:10,016 INFO  L225             Difference]: With dead ends: 336
[2024-11-10 07:11:10,016 INFO  L226             Difference]: Without dead ends: 250
[2024-11-10 07:11:10,018 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 59.1s TimeCoverageRelationStatistics Valid=295, Invalid=1028, Unknown=13, NotChecked=70, Total=1406
[2024-11-10 07:11:10,019 INFO  L432           NwaCegarLoop]: 82 mSDtfsCounter, 290 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time
[2024-11-10 07:11:10,019 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 376 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time]
[2024-11-10 07:11:10,020 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 250 states.
[2024-11-10 07:11:10,038 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 146.
[2024-11-10 07:11:10,039 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 146 states, 115 states have (on average 1.4260869565217391) internal successors, (164), 116 states have internal predecessors, (164), 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-11-10 07:11:10,040 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 216 transitions.
[2024-11-10 07:11:10,041 INFO  L78                 Accepts]: Start accepts. Automaton has 146 states and 216 transitions. Word has length 161
[2024-11-10 07:11:10,041 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-10 07:11:10,042 INFO  L471      AbstractCegarLoop]: Abstraction has 146 states and 216 transitions.
[2024-11-10 07:11:10,042 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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-11-10 07:11:10,042 INFO  L276                IsEmpty]: Start isEmpty. Operand 146 states and 216 transitions.
[2024-11-10 07:11:10,044 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2024-11-10 07:11:10,045 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-10 07:11:10,045 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, 1, 1, 1, 1, 1, 1]
[2024-11-10 07:11:10,064 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-10 07:11:10,246 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-11-10 07:11:10,246 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-10 07:11:10,247 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 07:11:10,247 INFO  L85        PathProgramCache]: Analyzing trace with hash 637266283, now seen corresponding path program 1 times
[2024-11-10 07:11:10,247 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 07:11:10,248 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695743876]
[2024-11-10 07:11:10,248 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 07:11:10,248 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 07:11:10,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,617 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2024-11-10 07:11:11,618 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,621 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-10 07:11:11,626 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,627 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-10 07:11:11,628 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,633 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-10 07:11:11,634 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,635 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-10 07:11:11,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,636 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-10 07:11:11,637 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,637 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-10 07:11:11,638 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,640 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-10 07:11:11,641 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,642 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-10 07:11:11,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,645 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-10 07:11:11,645 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,646 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-10 07:11:11,647 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,648 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-10 07:11:11,649 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,650 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-10 07:11:11,651 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,652 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-10 07:11:11,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,653 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-10 07:11:11,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,656 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-10 07:11:11,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,658 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-11-10 07:11:11,660 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,661 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101
[2024-11-10 07:11:11,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,662 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-10 07:11:11,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,666 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-10 07:11:11,667 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,875 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-10 07:11:11,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,879 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-10 07:11:11,880 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,882 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129
[2024-11-10 07:11:11,883 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,885 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134
[2024-11-10 07:11:11,886 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:11,888 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked.
[2024-11-10 07:11:11,888 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 07:11:11,888 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695743876]
[2024-11-10 07:11:11,889 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695743876] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-10 07:11:11,889 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042553278]
[2024-11-10 07:11:11,889 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 07:11:11,889 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-10 07:11:11,889 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-10 07:11:11,891 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-11-10 07:11:11,892 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-11-10 07:11:12,185 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:12,188 INFO  L255         TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-10 07:11:12,196 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-10 07:11:13,112 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked.
[2024-11-10 07:11:13,112 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-10 07:11:15,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked.
[2024-11-10 07:11:15,167 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042553278] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-10 07:11:15,167 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-10 07:11:15,167 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10
[2024-11-10 07:11:15,167 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362220869]
[2024-11-10 07:11:15,167 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-10 07:11:15,168 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-10 07:11:15,168 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 07:11:15,176 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-10 07:11:15,176 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-11-10 07:11:15,176 INFO  L87              Difference]: Start difference. First operand 146 states and 216 transitions. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-11-10 07:11:20,700 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-10 07:11:20,701 INFO  L93              Difference]: Finished difference Result 473 states and 671 transitions.
[2024-11-10 07:11:20,701 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-11-10 07:11:20,702 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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 162
[2024-11-10 07:11:20,703 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-10 07:11:20,707 INFO  L225             Difference]: With dead ends: 473
[2024-11-10 07:11:20,708 INFO  L226             Difference]: Without dead ends: 330
[2024-11-10 07:11:20,710 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756
[2024-11-10 07:11:20,710 INFO  L432           NwaCegarLoop]: 120 mSDtfsCounter, 438 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time
[2024-11-10 07:11:20,711 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 357 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time]
[2024-11-10 07:11:20,734 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 330 states.
[2024-11-10 07:11:20,764 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 123.
[2024-11-10 07:11:20,765 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 123 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 92 states have internal predecessors, (120), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-10 07:11:20,767 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions.
[2024-11-10 07:11:20,768 INFO  L78                 Accepts]: Start accepts. Automaton has 123 states and 172 transitions. Word has length 162
[2024-11-10 07:11:20,772 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-10 07:11:20,773 INFO  L471      AbstractCegarLoop]: Abstraction has 123 states and 172 transitions.
[2024-11-10 07:11:20,773 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-11-10 07:11:20,773 INFO  L276                IsEmpty]: Start isEmpty. Operand 123 states and 172 transitions.
[2024-11-10 07:11:20,775 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2024-11-10 07:11:20,775 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-10 07:11:20,776 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, 1, 1, 1, 1, 1, 1]
[2024-11-10 07:11:20,801 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-11-10 07:11:20,979 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-11-10 07:11:20,980 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-10 07:11:20,982 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 07:11:20,982 INFO  L85        PathProgramCache]: Analyzing trace with hash 1696544870, now seen corresponding path program 1 times
[2024-11-10 07:11:20,982 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 07:11:20,982 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463952248]
[2024-11-10 07:11:20,982 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 07:11:20,983 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 07:11:21,138 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-10 07:11:21,143 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158250830]
[2024-11-10 07:11:21,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 07:11:21,144 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-10 07:11:21,144 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-10 07:11:21,146 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-11-10 07:11:21,148 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-11-10 07:11:21,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 07:11:21,504 INFO  L255         TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 26 conjuncts are in the unsatisfiable core
[2024-11-10 07:11:21,510 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-10 07:11:30,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 728 proven. 111 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked.
[2024-11-10 07:11:30,269 INFO  L311         TraceCheckSpWp]: Computing backward predicates...