./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_operatoramount_amount50_file-9.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 c6cb51264034a58d9c2ef3f9375bfc11beb33c3340de6aeb50b163cdf8e9c8d1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:56:08,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:56:09,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:56:09,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:56:09,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:56:09,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:56:09,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:56:09,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:56:09,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:56:09,045 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:56:09,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:56:09,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:56:09,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:56:09,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:56:09,048 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:56:09,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:56:09,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:56:09,049 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:56:09,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:56:09,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:56:09,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:56:09,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:56:09,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:56:09,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:56:09,055 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:56:09,055 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:56:09,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:56:09,056 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:56:09,056 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:56:09,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:56:09,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:56:09,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:56:09,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:56:09,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:56:09,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:56:09,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:56:09,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:56:09,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:56:09,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:56:09,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:56:09,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:56:09,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:56:09,066 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 -> c6cb51264034a58d9c2ef3f9375bfc11beb33c3340de6aeb50b163cdf8e9c8d1 [2024-11-16 17:56:09,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:56:09,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:56:09,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:56:09,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:56:09,357 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:56:09,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-9.i [2024-11-16 17:56:10,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:56:11,054 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:56:11,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-9.i [2024-11-16 17:56:11,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8754adfd9/78515746728d4a7bb8c0f670aec863e6/FLAG823e14ebc [2024-11-16 17:56:11,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8754adfd9/78515746728d4a7bb8c0f670aec863e6 [2024-11-16 17:56:11,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:56:11,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:56:11,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:56:11,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:56:11,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:56:11,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:56:11" (1/1) ... [2024-11-16 17:56:11,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ce255d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:11, skipping insertion in model container [2024-11-16 17:56:11,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:56:11" (1/1) ... [2024-11-16 17:56:11,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:56:11,323 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_operatoramount_amount50_file-9.i[914,927] [2024-11-16 17:56:11,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:56:11,419 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:56:11,432 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_operatoramount_amount50_file-9.i[914,927] [2024-11-16 17:56:11,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:56:11,503 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:56:11,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:11 WrapperNode [2024-11-16 17:56:11,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:56:11,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:56:11,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:56:11,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:56:11,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:11" (1/1) ... [2024-11-16 17:56:11,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:11" (1/1) ... [2024-11-16 17:56:11,570 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-11-16 17:56:11,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:56:11,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:56:11,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:56:11,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:56:11,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:11" (1/1) ... [2024-11-16 17:56:11,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:11" (1/1) ... [2024-11-16 17:56:11,586 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:11" (1/1) ... [2024-11-16 17:56:11,611 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-16 17:56:11,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:11" (1/1) ... [2024-11-16 17:56:11,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:11" (1/1) ... [2024-11-16 17:56:11,619 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:11" (1/1) ... [2024-11-16 17:56:11,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:11" (1/1) ... [2024-11-16 17:56:11,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:11" (1/1) ... [2024-11-16 17:56:11,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:11" (1/1) ... [2024-11-16 17:56:11,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:56:11,628 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:56:11,628 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:56:11,628 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:56:11,629 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:11" (1/1) ... [2024-11-16 17:56:11,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:56:11,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:56:11,688 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-16 17:56:11,691 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-16 17:56:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:56:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:56:11,741 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:56:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:56:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:56:11,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:56:11,811 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:56:11,813 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:56:12,220 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~bitwise15#1;havoc property_#t~ite17#1;havoc property_#t~bitwise16#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2024-11-16 17:56:12,258 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-16 17:56:12,258 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:56:12,289 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:56:12,291 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:56:12,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:56:12 BoogieIcfgContainer [2024-11-16 17:56:12,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:56:12,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:56:12,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:56:12,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:56:12,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:56:11" (1/3) ... [2024-11-16 17:56:12,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c62bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:56:12, skipping insertion in model container [2024-11-16 17:56:12,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:11" (2/3) ... [2024-11-16 17:56:12,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c62bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:56:12, skipping insertion in model container [2024-11-16 17:56:12,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:56:12" (3/3) ... [2024-11-16 17:56:12,304 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-9.i [2024-11-16 17:56:12,322 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:56:12,323 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:56:12,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:56:12,395 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;@44683d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:56:12,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:56:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 61 states have internal predecessors, (83), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 17:56:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 17:56:12,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:56:12,411 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:56:12,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:56:12,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:56:12,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1462550466, now seen corresponding path program 1 times [2024-11-16 17:56:12,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:56:12,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640521262] [2024-11-16 17:56:12,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:12,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:56:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:12,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:56:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:12,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:56:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:12,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:56:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:12,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:56:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:12,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 17:56:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:12,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:56:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:12,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 17:56:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:12,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:56:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:12,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 17:56:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:12,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:56:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:12,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:56:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:12,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:56:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:12,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:56:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:12,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:56:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:12,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:56:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 17:56:12,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:56:12,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640521262] [2024-11-16 17:56:12,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640521262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:56:12,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:56:12,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:56:12,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627161734] [2024-11-16 17:56:12,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:56:12,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:56:12,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:56:12,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:56:12,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:56:12,936 INFO L87 Difference]: Start difference. First operand has 78 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 61 states have internal predecessors, (83), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 17:56:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:56:13,007 INFO L93 Difference]: Finished difference Result 148 states and 234 transitions. [2024-11-16 17:56:13,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:56:13,011 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 111 [2024-11-16 17:56:13,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:56:13,019 INFO L225 Difference]: With dead ends: 148 [2024-11-16 17:56:13,020 INFO L226 Difference]: Without dead ends: 73 [2024-11-16 17:56:13,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-16 17:56:13,028 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:56:13,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:56:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-16 17:56:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-16 17:56:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 17:56:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 105 transitions. [2024-11-16 17:56:13,085 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 105 transitions. Word has length 111 [2024-11-16 17:56:13,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:56:13,085 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 105 transitions. [2024-11-16 17:56:13,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 17:56:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 105 transitions. [2024-11-16 17:56:13,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 17:56:13,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:56:13,089 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:56:13,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:56:13,090 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:56:13,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:56:13,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1317236443, now seen corresponding path program 1 times [2024-11-16 17:56:13,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:56:13,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632566844] [2024-11-16 17:56:13,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:13,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:56:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:13,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:56:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:13,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:56:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:13,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:56:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:13,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:56:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:13,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 17:56:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:13,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:56:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:13,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 17:56:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:13,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:56:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:13,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 17:56:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:13,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:56:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:13,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:56:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:13,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:56:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:13,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:56:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:13,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:56:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:13,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:56:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:13,462 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 17:56:13,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:56:13,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632566844] [2024-11-16 17:56:13,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632566844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:56:13,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:56:13,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:56:13,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149225038] [2024-11-16 17:56:13,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:56:13,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 17:56:13,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:56:13,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 17:56:13,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:56:13,470 INFO L87 Difference]: Start difference. First operand 73 states and 105 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:56:13,510 INFO L93 Difference]: Finished difference Result 144 states and 209 transitions. [2024-11-16 17:56:13,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 17:56:13,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-16 17:56:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:56:13,514 INFO L225 Difference]: With dead ends: 144 [2024-11-16 17:56:13,514 INFO L226 Difference]: Without dead ends: 74 [2024-11-16 17:56:13,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-16 17:56:13,518 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:56:13,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:56:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-16 17:56:13,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-16 17:56:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 17:56:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 106 transitions. [2024-11-16 17:56:13,536 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 106 transitions. Word has length 111 [2024-11-16 17:56:13,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:56:13,538 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 106 transitions. [2024-11-16 17:56:13,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2024-11-16 17:56:13,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 17:56:13,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:56:13,540 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:56:13,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:56:13,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:56:13,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:56:13,543 INFO L85 PathProgramCache]: Analyzing trace with hash -578558016, now seen corresponding path program 1 times [2024-11-16 17:56:13,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:56:13,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802164215] [2024-11-16 17:56:13,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:13,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:56:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:16,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:56:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:16,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:56:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:16,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:56:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:16,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:56:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:16,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 17:56:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:16,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:56:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:16,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 17:56:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:16,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:56:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:16,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 17:56:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:16,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:56:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:16,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:56:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:16,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:56:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:16,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:56:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:16,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:56:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:16,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:56:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 17:56:16,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:56:16,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802164215] [2024-11-16 17:56:16,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802164215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:56:16,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:56:16,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 17:56:16,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394433529] [2024-11-16 17:56:16,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:56:16,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 17:56:16,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:56:16,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 17:56:16,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:56:16,121 INFO L87 Difference]: Start difference. First operand 74 states and 106 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:16,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:56:16,855 INFO L93 Difference]: Finished difference Result 229 states and 327 transitions. [2024-11-16 17:56:16,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 17:56:16,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-16 17:56:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:56:16,859 INFO L225 Difference]: With dead ends: 229 [2024-11-16 17:56:16,859 INFO L226 Difference]: Without dead ends: 158 [2024-11-16 17:56:16,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:56:16,862 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 130 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 17:56:16,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 394 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 17:56:16,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-16 17:56:16,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 101. [2024-11-16 17:56:16,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 17:56:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2024-11-16 17:56:16,881 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 112 [2024-11-16 17:56:16,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:56:16,882 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2024-11-16 17:56:16,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:16,883 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2024-11-16 17:56:16,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 17:56:16,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:56:16,885 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:56:16,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 17:56:16,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:56:16,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:56:16,886 INFO L85 PathProgramCache]: Analyzing trace with hash -367207103, now seen corresponding path program 1 times [2024-11-16 17:56:16,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:56:16,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123673101] [2024-11-16 17:56:16,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:16,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:56:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:19,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:56:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:19,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:56:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:19,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:56:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:19,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:56:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:19,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 17:56:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:19,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:56:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:19,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 17:56:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:19,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:56:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:19,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 17:56:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:19,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:56:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:19,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:56:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:19,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:56:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:19,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:56:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:19,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:56:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:19,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:56:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 17:56:19,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:56:19,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123673101] [2024-11-16 17:56:19,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123673101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:56:19,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:56:19,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 17:56:19,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050877012] [2024-11-16 17:56:19,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:56:19,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 17:56:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:56:19,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 17:56:19,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:56:19,154 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:19,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:56:19,893 INFO L93 Difference]: Finished difference Result 258 states and 370 transitions. [2024-11-16 17:56:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 17:56:19,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-16 17:56:19,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:56:19,896 INFO L225 Difference]: With dead ends: 258 [2024-11-16 17:56:19,896 INFO L226 Difference]: Without dead ends: 160 [2024-11-16 17:56:19,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 17:56:19,902 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 98 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 17:56:19,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 687 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 17:56:19,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-16 17:56:19,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 101. [2024-11-16 17:56:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 17:56:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2024-11-16 17:56:19,921 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 112 [2024-11-16 17:56:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:56:19,922 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2024-11-16 17:56:19,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2024-11-16 17:56:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 17:56:19,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:56:19,932 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:56:19,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 17:56:19,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:56:19,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:56:19,933 INFO L85 PathProgramCache]: Analyzing trace with hash 666206465, now seen corresponding path program 1 times [2024-11-16 17:56:19,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:56:19,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260587612] [2024-11-16 17:56:19,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:19,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:56:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:20,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:56:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:20,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:56:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:20,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:56:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:20,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:56:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:20,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 17:56:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:20,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:56:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:20,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 17:56:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:20,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:56:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:20,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 17:56:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:20,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:56:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:20,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:56:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:20,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:56:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:20,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:56:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:20,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:56:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:20,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:56:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 17:56:20,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:56:20,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260587612] [2024-11-16 17:56:20,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260587612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:56:20,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:56:20,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 17:56:20,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988928862] [2024-11-16 17:56:20,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:56:20,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 17:56:20,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:56:20,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 17:56:20,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:56:20,640 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:21,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:56:21,364 INFO L93 Difference]: Finished difference Result 258 states and 370 transitions. [2024-11-16 17:56:21,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 17:56:21,366 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-16 17:56:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:56:21,368 INFO L225 Difference]: With dead ends: 258 [2024-11-16 17:56:21,368 INFO L226 Difference]: Without dead ends: 160 [2024-11-16 17:56:21,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 17:56:21,369 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 98 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 17:56:21,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 710 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 17:56:21,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-16 17:56:21,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 101. [2024-11-16 17:56:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 17:56:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2024-11-16 17:56:21,385 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 112 [2024-11-16 17:56:21,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:56:21,389 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2024-11-16 17:56:21,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2024-11-16 17:56:21,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 17:56:21,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:56:21,391 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:56:21,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 17:56:21,391 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:56:21,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:56:21,392 INFO L85 PathProgramCache]: Analyzing trace with hash 877557378, now seen corresponding path program 1 times [2024-11-16 17:56:21,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:56:21,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966429293] [2024-11-16 17:56:21,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:21,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:56:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:22,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:56:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:22,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:56:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:22,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:56:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:22,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:56:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:22,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 17:56:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:22,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:56:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:22,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 17:56:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:22,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:56:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:22,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 17:56:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:22,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:56:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:22,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:56:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:22,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:56:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:22,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:56:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:22,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:56:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:22,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:56:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 17:56:22,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:56:22,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966429293] [2024-11-16 17:56:22,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966429293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:56:22,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:56:22,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 17:56:22,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755393778] [2024-11-16 17:56:22,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:56:22,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 17:56:22,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:56:22,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 17:56:22,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:56:22,259 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:56:23,096 INFO L93 Difference]: Finished difference Result 260 states and 372 transitions. [2024-11-16 17:56:23,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 17:56:23,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-16 17:56:23,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:56:23,098 INFO L225 Difference]: With dead ends: 260 [2024-11-16 17:56:23,099 INFO L226 Difference]: Without dead ends: 162 [2024-11-16 17:56:23,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:56:23,100 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 98 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 17:56:23,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 767 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 17:56:23,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-16 17:56:23,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 76. [2024-11-16 17:56:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 17:56:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2024-11-16 17:56:23,107 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 112 [2024-11-16 17:56:23,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:56:23,108 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2024-11-16 17:56:23,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2024-11-16 17:56:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 17:56:23,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:56:23,109 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:56:23,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 17:56:23,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:56:23,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:56:23,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1792049406, now seen corresponding path program 1 times [2024-11-16 17:56:23,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:56:23,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666596344] [2024-11-16 17:56:23,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:23,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:56:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:56:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:56:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:56:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:56:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 17:56:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:56:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 17:56:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:56:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 17:56:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:56:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:56:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:56:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:56:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:56:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:56:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 17:56:23,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:56:23,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666596344] [2024-11-16 17:56:23,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666596344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:56:23,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:56:23,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:56:23,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916036157] [2024-11-16 17:56:23,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:56:23,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 17:56:23,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:56:23,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 17:56:23,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:56:23,180 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:23,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:56:23,224 INFO L93 Difference]: Finished difference Result 216 states and 310 transitions. [2024-11-16 17:56:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 17:56:23,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2024-11-16 17:56:23,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:56:23,226 INFO L225 Difference]: With dead ends: 216 [2024-11-16 17:56:23,227 INFO L226 Difference]: Without dead ends: 143 [2024-11-16 17:56:23,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-16 17:56:23,228 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 85 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:56:23,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 173 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:56:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-16 17:56:23,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 102. [2024-11-16 17:56:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 85 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 17:56:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2024-11-16 17:56:23,242 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 114 [2024-11-16 17:56:23,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:56:23,243 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 147 transitions. [2024-11-16 17:56:23,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 147 transitions. [2024-11-16 17:56:23,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 17:56:23,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:56:23,244 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:56:23,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 17:56:23,244 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:56:23,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:56:23,245 INFO L85 PathProgramCache]: Analyzing trace with hash 826788864, now seen corresponding path program 1 times [2024-11-16 17:56:23,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:56:23,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589305947] [2024-11-16 17:56:23,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:23,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:56:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:56:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:56:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:56:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:56:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 17:56:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:56:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 17:56:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:56:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 17:56:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:56:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:56:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:56:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:56:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:56:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:56:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 17:56:23,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:56:23,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589305947] [2024-11-16 17:56:23,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589305947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:56:23,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:56:23,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 17:56:23,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017285589] [2024-11-16 17:56:23,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:56:23,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 17:56:23,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:56:23,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 17:56:23,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:56:23,987 INFO L87 Difference]: Start difference. First operand 102 states and 147 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:24,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:56:24,612 INFO L93 Difference]: Finished difference Result 413 states and 583 transitions. [2024-11-16 17:56:24,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 17:56:24,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2024-11-16 17:56:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:56:24,617 INFO L225 Difference]: With dead ends: 413 [2024-11-16 17:56:24,617 INFO L226 Difference]: Without dead ends: 314 [2024-11-16 17:56:24,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:56:24,618 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 182 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 17:56:24,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 570 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 17:56:24,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-16 17:56:24,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 237. [2024-11-16 17:56:24,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 205 states have (on average 1.3707317073170733) internal successors, (281), 207 states have internal predecessors, (281), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 17:56:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 337 transitions. [2024-11-16 17:56:24,635 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 337 transitions. Word has length 114 [2024-11-16 17:56:24,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:56:24,636 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 337 transitions. [2024-11-16 17:56:24,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 337 transitions. [2024-11-16 17:56:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 17:56:24,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:56:24,638 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:56:24,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 17:56:24,638 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:56:24,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:56:24,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1546486900, now seen corresponding path program 1 times [2024-11-16 17:56:24,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:56:24,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566115149] [2024-11-16 17:56:24,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:24,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:56:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:56:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:56:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:56:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:56:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 17:56:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:56:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 17:56:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:56:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 17:56:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:56:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:56:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:56:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:56:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:56:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:56:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 17:56:24,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:56:24,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566115149] [2024-11-16 17:56:24,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566115149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:56:24,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725340029] [2024-11-16 17:56:24,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:24,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:56:24,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:56:24,800 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-16 17:56:24,803 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-16 17:56:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:24,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 17:56:24,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:56:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-16 17:56:25,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:56:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 17:56:25,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725340029] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:56:25,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 17:56:25,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-16 17:56:25,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776785812] [2024-11-16 17:56:25,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 17:56:25,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 17:56:25,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:56:25,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 17:56:25,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 17:56:25,404 INFO L87 Difference]: Start difference. First operand 237 states and 337 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-16 17:56:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:56:25,702 INFO L93 Difference]: Finished difference Result 493 states and 688 transitions. [2024-11-16 17:56:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 17:56:25,703 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 114 [2024-11-16 17:56:25,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:56:25,706 INFO L225 Difference]: With dead ends: 493 [2024-11-16 17:56:25,706 INFO L226 Difference]: Without dead ends: 259 [2024-11-16 17:56:25,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-16 17:56:25,707 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 166 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 17:56:25,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 171 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 17:56:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-16 17:56:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2024-11-16 17:56:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 220 states have (on average 1.3272727272727274) internal successors, (292), 222 states have internal predecessors, (292), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 17:56:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 348 transitions. [2024-11-16 17:56:25,724 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 348 transitions. Word has length 114 [2024-11-16 17:56:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:56:25,724 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 348 transitions. [2024-11-16 17:56:25,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-16 17:56:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 348 transitions. [2024-11-16 17:56:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 17:56:25,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:56:25,726 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:56:25,745 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-11-16 17:56:25,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:56:25,927 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:56:25,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:56:25,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1904008525, now seen corresponding path program 1 times [2024-11-16 17:56:25,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:56:25,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065089526] [2024-11-16 17:56:25,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:25,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:56:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 17:56:26,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1093647768] [2024-11-16 17:56:26,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:26,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:56:26,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:56:26,009 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-16 17:56:26,011 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-16 17:56:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:26,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 17:56:26,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:56:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 30 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-16 17:56:26,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:56:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 17:56:26,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:56:26,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065089526] [2024-11-16 17:56:26,871 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 17:56:26,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093647768] [2024-11-16 17:56:26,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093647768] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:56:26,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 17:56:26,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-16 17:56:26,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787988879] [2024-11-16 17:56:26,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 17:56:26,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 17:56:26,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:56:26,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 17:56:26,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-16 17:56:26,874 INFO L87 Difference]: Start difference. First operand 257 states and 348 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-16 17:56:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:56:27,752 INFO L93 Difference]: Finished difference Result 661 states and 862 transitions. [2024-11-16 17:56:27,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 17:56:27,753 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 114 [2024-11-16 17:56:27,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:56:27,756 INFO L225 Difference]: With dead ends: 661 [2024-11-16 17:56:27,756 INFO L226 Difference]: Without dead ends: 407 [2024-11-16 17:56:27,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-16 17:56:27,759 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 249 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 17:56:27,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 908 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 17:56:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-16 17:56:27,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 244. [2024-11-16 17:56:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 209 states have (on average 1.3157894736842106) internal successors, (275), 210 states have internal predecessors, (275), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 17:56:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 327 transitions. [2024-11-16 17:56:27,782 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 327 transitions. Word has length 114 [2024-11-16 17:56:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:56:27,783 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 327 transitions. [2024-11-16 17:56:27,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-16 17:56:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 327 transitions. [2024-11-16 17:56:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 17:56:27,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:56:27,784 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:56:27,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-16 17:56:27,985 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,SelfDestructingSolverStorable9 [2024-11-16 17:56:27,986 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:56:27,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:56:27,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2071553345, now seen corresponding path program 1 times [2024-11-16 17:56:27,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:56:27,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849469381] [2024-11-16 17:56:27,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:27,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:56:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:56:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:56:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:56:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:56:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 17:56:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:56:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 17:56:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:56:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 17:56:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:56:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:56:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:56:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:56:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:56:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:56:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 17:56:28,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:56:28,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849469381] [2024-11-16 17:56:28,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849469381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:56:28,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:56:28,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 17:56:28,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053995583] [2024-11-16 17:56:28,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:56:28,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 17:56:28,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:56:28,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 17:56:28,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:56:28,394 INFO L87 Difference]: Start difference. First operand 244 states and 327 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:28,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:56:28,810 INFO L93 Difference]: Finished difference Result 711 states and 932 transitions. [2024-11-16 17:56:28,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 17:56:28,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2024-11-16 17:56:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:56:28,813 INFO L225 Difference]: With dead ends: 711 [2024-11-16 17:56:28,813 INFO L226 Difference]: Without dead ends: 470 [2024-11-16 17:56:28,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:56:28,814 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 116 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 17:56:28,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 552 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 17:56:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-16 17:56:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 251. [2024-11-16 17:56:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 216 states have (on average 1.3194444444444444) internal successors, (285), 217 states have internal predecessors, (285), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 17:56:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 337 transitions. [2024-11-16 17:56:28,833 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 337 transitions. Word has length 114 [2024-11-16 17:56:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:56:28,834 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 337 transitions. [2024-11-16 17:56:28,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 337 transitions. [2024-11-16 17:56:28,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 17:56:28,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:56:28,835 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:56:28,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 17:56:28,836 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:56:28,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:56:28,836 INFO L85 PathProgramCache]: Analyzing trace with hash -199549683, now seen corresponding path program 1 times [2024-11-16 17:56:28,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:56:28,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632218244] [2024-11-16 17:56:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:28,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:56:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:56:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:56:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:56:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:56:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 17:56:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:56:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 17:56:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:56:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 17:56:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:56:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:56:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:56:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:56:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:56:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:56:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 17:56:28,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:56:28,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632218244] [2024-11-16 17:56:28,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632218244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:56:28,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:56:28,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:56:28,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312765626] [2024-11-16 17:56:28,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:56:28,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 17:56:28,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:56:28,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 17:56:28,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:56:28,901 INFO L87 Difference]: Start difference. First operand 251 states and 337 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:56:29,040 INFO L93 Difference]: Finished difference Result 584 states and 785 transitions. [2024-11-16 17:56:29,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 17:56:29,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2024-11-16 17:56:29,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:56:29,043 INFO L225 Difference]: With dead ends: 584 [2024-11-16 17:56:29,043 INFO L226 Difference]: Without dead ends: 336 [2024-11-16 17:56:29,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-16 17:56:29,044 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 29 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:56:29,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 169 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:56:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-16 17:56:29,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 269. [2024-11-16 17:56:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 235 states have internal predecessors, (308), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 17:56:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 360 transitions. [2024-11-16 17:56:29,061 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 360 transitions. Word has length 115 [2024-11-16 17:56:29,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:56:29,063 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 360 transitions. [2024-11-16 17:56:29,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 17:56:29,064 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 360 transitions. [2024-11-16 17:56:29,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 17:56:29,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:56:29,065 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:56:29,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 17:56:29,065 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:56:29,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:56:29,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2005182239, now seen corresponding path program 1 times [2024-11-16 17:56:29,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:56:29,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005175844] [2024-11-16 17:56:29,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:29,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:56:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 17:56:29,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2107192430] [2024-11-16 17:56:29,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:29,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:56:29,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:56:29,124 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-16 17:56:29,126 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-16 17:56:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:56:29,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 17:56:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:56:29,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 17:56:29,654 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 17:56:29,655 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:56:29,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 17:56:29,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:56:29,861 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:56:29,952 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:56:29,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:56:29 BoogieIcfgContainer [2024-11-16 17:56:29,955 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:56:29,955 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:56:29,955 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:56:29,956 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:56:29,956 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:56:12" (3/4) ... [2024-11-16 17:56:29,958 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 17:56:29,960 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:56:29,960 INFO L158 Benchmark]: Toolchain (without parser) took 18872.79ms. Allocated memory was 184.5MB in the beginning and 423.6MB in the end (delta: 239.1MB). Free memory was 127.1MB in the beginning and 176.2MB in the end (delta: -49.1MB). Peak memory consumption was 191.9MB. Max. memory is 16.1GB. [2024-11-16 17:56:29,960 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 184.5MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:56:29,961 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.59ms. Allocated memory is still 184.5MB. Free memory was 127.1MB in the beginning and 112.0MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 17:56:29,961 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.82ms. Allocated memory is still 184.5MB. Free memory was 112.0MB in the beginning and 109.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:56:29,961 INFO L158 Benchmark]: Boogie Preprocessor took 55.25ms. Allocated memory is still 184.5MB. Free memory was 109.1MB in the beginning and 105.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 17:56:29,961 INFO L158 Benchmark]: IcfgBuilder took 664.49ms. Allocated memory is still 184.5MB. Free memory was 105.7MB in the beginning and 83.1MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 17:56:29,961 INFO L158 Benchmark]: TraceAbstraction took 17660.50ms. Allocated memory was 184.5MB in the beginning and 423.6MB in the end (delta: 239.1MB). Free memory was 82.7MB in the beginning and 176.2MB in the end (delta: -93.5MB). Peak memory consumption was 147.8MB. Max. memory is 16.1GB. [2024-11-16 17:56:29,962 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 423.6MB. Free memory is still 176.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:56:29,963 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 184.5MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.59ms. Allocated memory is still 184.5MB. Free memory was 127.1MB in the beginning and 112.0MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.82ms. Allocated memory is still 184.5MB. Free memory was 112.0MB in the beginning and 109.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.25ms. Allocated memory is still 184.5MB. Free memory was 109.1MB in the beginning and 105.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 664.49ms. Allocated memory is still 184.5MB. Free memory was 105.7MB in the beginning and 83.1MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17660.50ms. Allocated memory was 184.5MB in the beginning and 423.6MB in the end (delta: 239.1MB). Free memory was 82.7MB in the beginning and 176.2MB in the end (delta: -93.5MB). Peak memory consumption was 147.8MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 423.6MB. Free memory is still 176.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of shiftLeft at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L114] last_1_var_1_10 = var_1_10 [L115] last_1_var_1_12 = var_1_12 [L116] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] RET updateLastVariables() [L127] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_5 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] var_1_6 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] var_1_7 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L102] var_1_8 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_9=9/5] [L103] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_9=9/5] [L104] var_1_9 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L108] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L108] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L109] var_1_15 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L111] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L127] RET updateVariables() [L128] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L45] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L46] COND TRUE var_1_6 <= stepLocal_2 [L47] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L51] var_1_18 = var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L52] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L52] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L59] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L61] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L62] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L63] COND FALSE !((- var_1_9) <= var_1_8) [L76] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L78] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L79] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L79] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L80] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L119] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L119] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L119-L120] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.5s, OverallIterations: 13, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1257 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1251 mSDsluCounter, 5392 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4076 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3320 IncrementalHoareTripleChecker+Invalid, 3348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 1316 mSDtfsCounter, 3320 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 905 GetRequests, 820 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred in iteration=12, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 830 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 1813 NumberOfCodeBlocks, 1813 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1682 ConstructedInterpolants, 0 QuantifiedInterpolants, 5560 SizeOfPredicates, 9 NumberOfNonLiveVariables, 552 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 6114/6300 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 17:56:30,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_operatoramount_amount50_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 c6cb51264034a58d9c2ef3f9375bfc11beb33c3340de6aeb50b163cdf8e9c8d1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:56:32,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:56:32,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 17:56:32,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:56:32,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:56:32,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:56:32,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:56:32,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:56:32,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:56:32,382 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:56:32,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:56:32,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:56:32,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:56:32,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:56:32,385 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:56:32,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:56:32,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:56:32,389 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:56:32,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:56:32,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:56:32,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:56:32,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:56:32,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:56:32,391 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 17:56:32,391 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 17:56:32,391 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:56:32,391 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 17:56:32,392 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:56:32,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:56:32,393 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:56:32,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:56:32,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:56:32,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:56:32,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:56:32,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:56:32,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:56:32,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:56:32,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:56:32,395 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 17:56:32,396 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 17:56:32,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:56:32,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:56:32,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:56:32,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:56:32,398 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 -> c6cb51264034a58d9c2ef3f9375bfc11beb33c3340de6aeb50b163cdf8e9c8d1 [2024-11-16 17:56:32,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:56:32,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:56:32,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:56:32,745 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:56:32,746 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:56:32,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-9.i [2024-11-16 17:56:34,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:56:34,539 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:56:34,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-9.i [2024-11-16 17:56:34,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/232794904/7fb98c853a924fc7adea03ac25063830/FLAGf488e0629 [2024-11-16 17:56:34,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/232794904/7fb98c853a924fc7adea03ac25063830 [2024-11-16 17:56:34,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:56:34,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:56:34,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:56:34,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:56:34,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:56:34,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:56:34" (1/1) ... [2024-11-16 17:56:34,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e4f83a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:34, skipping insertion in model container [2024-11-16 17:56:34,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:56:34" (1/1) ... [2024-11-16 17:56:34,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:56:35,156 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_operatoramount_amount50_file-9.i[914,927] [2024-11-16 17:56:35,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:56:35,249 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:56:35,263 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_operatoramount_amount50_file-9.i[914,927] [2024-11-16 17:56:35,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:56:35,325 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:56:35,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:35 WrapperNode [2024-11-16 17:56:35,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:56:35,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:56:35,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:56:35,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:56:35,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:35" (1/1) ... [2024-11-16 17:56:35,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:35" (1/1) ... [2024-11-16 17:56:35,383 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-16 17:56:35,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:56:35,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:56:35,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:56:35,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:56:35,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:35" (1/1) ... [2024-11-16 17:56:35,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:35" (1/1) ... [2024-11-16 17:56:35,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:35" (1/1) ... [2024-11-16 17:56:35,424 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-16 17:56:35,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:35" (1/1) ... [2024-11-16 17:56:35,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:35" (1/1) ... [2024-11-16 17:56:35,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:35" (1/1) ... [2024-11-16 17:56:35,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:35" (1/1) ... [2024-11-16 17:56:35,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:35" (1/1) ... [2024-11-16 17:56:35,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:35" (1/1) ... [2024-11-16 17:56:35,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:56:35,448 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:56:35,452 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:56:35,452 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:56:35,453 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:35" (1/1) ... [2024-11-16 17:56:35,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:56:35,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:56:35,483 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-16 17:56:35,486 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-16 17:56:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:56:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 17:56:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:56:35,526 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:56:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:56:35,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:56:35,600 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:56:35,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:56:36,030 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-16 17:56:36,030 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:56:36,049 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:56:36,049 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:56:36,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:56:36 BoogieIcfgContainer [2024-11-16 17:56:36,049 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:56:36,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:56:36,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:56:36,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:56:36,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:56:34" (1/3) ... [2024-11-16 17:56:36,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399ecefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:56:36, skipping insertion in model container [2024-11-16 17:56:36,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:56:35" (2/3) ... [2024-11-16 17:56:36,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399ecefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:56:36, skipping insertion in model container [2024-11-16 17:56:36,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:56:36" (3/3) ... [2024-11-16 17:56:36,062 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-9.i [2024-11-16 17:56:36,078 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:56:36,078 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:56:36,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:56:36,141 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;@4a2e49a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:56:36,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:56:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 17:56:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 17:56:36,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:56:36,162 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:56:36,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:56:36,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:56:36,169 INFO L85 PathProgramCache]: Analyzing trace with hash 424187399, now seen corresponding path program 1 times [2024-11-16 17:56:36,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:56:36,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250408963] [2024-11-16 17:56:36,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:36,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:56:36,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:56:36,189 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:56:36,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 17:56:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:36,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 17:56:36,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:56:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-16 17:56:36,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:56:36,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:56:36,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250408963] [2024-11-16 17:56:36,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250408963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:56:36,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:56:36,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:56:36,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109171891] [2024-11-16 17:56:36,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:56:36,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:56:36,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:56:36,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:56:36,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:56:36,517 INFO L87 Difference]: Start difference. First operand has 59 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 17:56:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:56:36,538 INFO L93 Difference]: Finished difference Result 110 states and 180 transitions. [2024-11-16 17:56:36,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:56:36,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 103 [2024-11-16 17:56:36,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:56:36,546 INFO L225 Difference]: With dead ends: 110 [2024-11-16 17:56:36,546 INFO L226 Difference]: Without dead ends: 54 [2024-11-16 17:56:36,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-16 17:56:36,552 INFO L432 NwaCegarLoop]: 77 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, 77 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-16 17:56:36,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:56:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-16 17:56:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-16 17:56:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 17:56:36,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2024-11-16 17:56:36,590 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 103 [2024-11-16 17:56:36,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:56:36,590 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2024-11-16 17:56:36,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 17:56:36,591 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2024-11-16 17:56:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 17:56:36,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:56:36,594 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:56:36,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 17:56:36,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:56:36,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:56:36,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:56:36,796 INFO L85 PathProgramCache]: Analyzing trace with hash 31488059, now seen corresponding path program 1 times [2024-11-16 17:56:36,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:56:36,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317354291] [2024-11-16 17:56:36,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:56:36,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:56:36,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:56:36,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:56:36,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 17:56:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:56:36,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 17:56:36,994 INFO L278 TraceCheckSpWp]: Computing forward predicates...