./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_amount25_file-32.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 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:52:17,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:52:17,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 23:52:17,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:52:17,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:52:17,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:52:17,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:52:17,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:52:17,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:52:17,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:52:17,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:52:17,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:52:17,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:52:17,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:52:17,626 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:52:17,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:52:17,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:52:17,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:52:17,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 23:52:17,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:52:17,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:52:17,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:52:17,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:52:17,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:52:17,635 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:52:17,635 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:52:17,635 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:52:17,636 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:52:17,636 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:52:17,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:52:17,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:52:17,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:52:17,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:52:17,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:52:17,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:52:17,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:52:17,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 23:52:17,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 23:52:17,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:52:17,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:52:17,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:52:17,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:52:17,641 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 -> 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 [2024-11-18 23:52:17,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:52:17,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:52:17,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:52:17,966 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:52:17,967 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:52:17,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2024-11-18 23:52:19,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:52:19,582 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:52:19,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2024-11-18 23:52:19,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9e8578e/1001f8dd28d34c848d7ef6515df603ee/FLAGbb3f0f682 [2024-11-18 23:52:19,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9e8578e/1001f8dd28d34c848d7ef6515df603ee [2024-11-18 23:52:19,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:52:19,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:52:19,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:52:19,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:52:19,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:52:19,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:52:19" (1/1) ... [2024-11-18 23:52:19,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e8df94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:19, skipping insertion in model container [2024-11-18 23:52:19,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:52:19" (1/1) ... [2024-11-18 23:52:19,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:52:19,831 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_amount25_file-32.i[915,928] [2024-11-18 23:52:19,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:52:19,911 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:52:19,925 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_amount25_file-32.i[915,928] [2024-11-18 23:52:19,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:52:19,977 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:52:19,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:19 WrapperNode [2024-11-18 23:52:19,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:52:19,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:52:19,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:52:19,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:52:19,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:19" (1/1) ... [2024-11-18 23:52:19,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:19" (1/1) ... [2024-11-18 23:52:20,048 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-18 23:52:20,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:52:20,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:52:20,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:52:20,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:52:20,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:19" (1/1) ... [2024-11-18 23:52:20,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:19" (1/1) ... [2024-11-18 23:52:20,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:19" (1/1) ... [2024-11-18 23:52:20,096 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-18 23:52:20,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:19" (1/1) ... [2024-11-18 23:52:20,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:19" (1/1) ... [2024-11-18 23:52:20,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:19" (1/1) ... [2024-11-18 23:52:20,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:19" (1/1) ... [2024-11-18 23:52:20,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:19" (1/1) ... [2024-11-18 23:52:20,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:19" (1/1) ... [2024-11-18 23:52:20,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:52:20,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:52:20,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:52:20,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:52:20,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:19" (1/1) ... [2024-11-18 23:52:20,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:52:20,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:52:20,174 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-18 23:52:20,181 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-18 23:52:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:52:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:52:20,229 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:52:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 23:52:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:52:20,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:52:20,346 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:52:20,349 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:52:20,784 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-18 23:52:20,785 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:52:20,807 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:52:20,808 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:52:20,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:52:20 BoogieIcfgContainer [2024-11-18 23:52:20,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:52:20,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:52:20,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:52:20,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:52:20,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:52:19" (1/3) ... [2024-11-18 23:52:20,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff200e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:52:20, skipping insertion in model container [2024-11-18 23:52:20,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:19" (2/3) ... [2024-11-18 23:52:20,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff200e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:52:20, skipping insertion in model container [2024-11-18 23:52:20,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:52:20" (3/3) ... [2024-11-18 23:52:20,817 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-32.i [2024-11-18 23:52:20,833 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:52:20,834 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:52:20,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:52:20,901 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;@6118ba31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:52:20,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:52:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 23:52:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-18 23:52:20,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:20,920 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:20,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:20,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash -571826580, now seen corresponding path program 1 times [2024-11-18 23:52:20,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:20,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142901525] [2024-11-18 23:52:20,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:20,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-18 23:52:21,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:21,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142901525] [2024-11-18 23:52:21,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142901525] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:52:21,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945463472] [2024-11-18 23:52:21,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:21,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:52:21,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:52:21,217 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-18 23:52:21,218 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-18 23:52:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:21,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:52:21,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:52:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-18 23:52:21,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:52:21,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945463472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:21,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:52:21,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 23:52:21,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375816714] [2024-11-18 23:52:21,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:21,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:52:21,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:21,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:52:21,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:52:21,438 INFO L87 Difference]: Start difference. First operand has 79 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 23:52:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:21,468 INFO L93 Difference]: Finished difference Result 151 states and 248 transitions. [2024-11-18 23:52:21,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:52:21,470 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 110 [2024-11-18 23:52:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:21,478 INFO L225 Difference]: With dead ends: 151 [2024-11-18 23:52:21,478 INFO L226 Difference]: Without dead ends: 75 [2024-11-18 23:52:21,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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-18 23:52:21,484 INFO L432 NwaCegarLoop]: 112 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, 112 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-18 23:52:21,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:52:21,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-18 23:52:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-18 23:52:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 23:52:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 112 transitions. [2024-11-18 23:52:21,528 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 112 transitions. Word has length 110 [2024-11-18 23:52:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:21,529 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 112 transitions. [2024-11-18 23:52:21,529 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 23:52:21,530 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2024-11-18 23:52:21,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-18 23:52:21,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:21,534 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:21,554 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-18 23:52:21,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 23:52:21,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:21,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:21,740 INFO L85 PathProgramCache]: Analyzing trace with hash 153189996, now seen corresponding path program 1 times [2024-11-18 23:52:21,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:21,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999520652] [2024-11-18 23:52:21,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:21,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:22,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:22,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999520652] [2024-11-18 23:52:22,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999520652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:22,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:22,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 23:52:22,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465744190] [2024-11-18 23:52:22,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:22,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 23:52:22,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:22,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 23:52:22,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 23:52:22,252 INFO L87 Difference]: Start difference. First operand 75 states and 112 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:22,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:22,400 INFO L93 Difference]: Finished difference Result 255 states and 383 transitions. [2024-11-18 23:52:22,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 23:52:22,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-11-18 23:52:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:22,406 INFO L225 Difference]: With dead ends: 255 [2024-11-18 23:52:22,406 INFO L226 Difference]: Without dead ends: 183 [2024-11-18 23:52:22,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 23:52:22,408 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 142 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:22,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 366 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 23:52:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-18 23:52:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 145. [2024-11-18 23:52:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-18 23:52:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 219 transitions. [2024-11-18 23:52:22,435 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 219 transitions. Word has length 110 [2024-11-18 23:52:22,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:22,436 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 219 transitions. [2024-11-18 23:52:22,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-11-18 23:52:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-18 23:52:22,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:22,438 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:22,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 23:52:22,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:22,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:22,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1435157906, now seen corresponding path program 1 times [2024-11-18 23:52:22,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:22,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361615997] [2024-11-18 23:52:22,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:22,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:22,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:22,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361615997] [2024-11-18 23:52:22,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361615997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:22,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:22,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 23:52:22,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451440272] [2024-11-18 23:52:22,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:22,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 23:52:22,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:22,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 23:52:22,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 23:52:22,715 INFO L87 Difference]: Start difference. First operand 145 states and 219 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:22,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:22,880 INFO L93 Difference]: Finished difference Result 406 states and 616 transitions. [2024-11-18 23:52:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 23:52:22,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-11-18 23:52:22,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:22,885 INFO L225 Difference]: With dead ends: 406 [2024-11-18 23:52:22,885 INFO L226 Difference]: Without dead ends: 264 [2024-11-18 23:52:22,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 23:52:22,890 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 125 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:22,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 405 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 23:52:22,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-18 23:52:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 192. [2024-11-18 23:52:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 140 states have internal predecessors, (195), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-18 23:52:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 291 transitions. [2024-11-18 23:52:22,936 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 291 transitions. Word has length 110 [2024-11-18 23:52:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:22,938 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 291 transitions. [2024-11-18 23:52:22,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 291 transitions. [2024-11-18 23:52:22,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-18 23:52:22,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:22,941 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:22,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 23:52:22,944 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:22,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:22,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1846945656, now seen corresponding path program 1 times [2024-11-18 23:52:22,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:22,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724063422] [2024-11-18 23:52:22,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:22,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:23,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:23,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724063422] [2024-11-18 23:52:23,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724063422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:23,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:23,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:52:23,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043317412] [2024-11-18 23:52:23,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:23,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:52:23,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:23,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:52:23,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:52:23,104 INFO L87 Difference]: Start difference. First operand 192 states and 291 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:23,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:23,154 INFO L93 Difference]: Finished difference Result 402 states and 612 transitions. [2024-11-18 23:52:23,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:52:23,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-18 23:52:23,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:23,158 INFO L225 Difference]: With dead ends: 402 [2024-11-18 23:52:23,158 INFO L226 Difference]: Without dead ends: 260 [2024-11-18 23:52:23,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-18 23:52:23,161 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 73 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:23,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 203 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:52:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-18 23:52:23,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2024-11-18 23:52:23,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 189 states have (on average 1.380952380952381) internal successors, (261), 189 states have internal predecessors, (261), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-18 23:52:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 389 transitions. [2024-11-18 23:52:23,191 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 389 transitions. Word has length 111 [2024-11-18 23:52:23,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:23,192 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 389 transitions. [2024-11-18 23:52:23,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 389 transitions. [2024-11-18 23:52:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-18 23:52:23,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:23,198 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:23,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 23:52:23,199 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:23,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1320145322, now seen corresponding path program 1 times [2024-11-18 23:52:23,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:23,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262878103] [2024-11-18 23:52:23,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:23,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:23,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:23,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262878103] [2024-11-18 23:52:23,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262878103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:23,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:23,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 23:52:23,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606649665] [2024-11-18 23:52:23,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:23,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 23:52:23,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:23,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 23:52:23,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-18 23:52:23,806 INFO L87 Difference]: Start difference. First operand 258 states and 389 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:24,050 INFO L93 Difference]: Finished difference Result 586 states and 873 transitions. [2024-11-18 23:52:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 23:52:24,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-18 23:52:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:24,056 INFO L225 Difference]: With dead ends: 586 [2024-11-18 23:52:24,056 INFO L226 Difference]: Without dead ends: 374 [2024-11-18 23:52:24,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 23:52:24,059 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 163 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:24,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 296 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:52:24,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-18 23:52:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 334. [2024-11-18 23:52:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 265 states have (on average 1.4) internal successors, (371), 265 states have internal predecessors, (371), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-18 23:52:24,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 499 transitions. [2024-11-18 23:52:24,096 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 499 transitions. Word has length 111 [2024-11-18 23:52:24,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:24,097 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 499 transitions. [2024-11-18 23:52:24,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 499 transitions. [2024-11-18 23:52:24,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-18 23:52:24,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:24,101 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:24,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 23:52:24,101 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:24,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:24,102 INFO L85 PathProgramCache]: Analyzing trace with hash -217033849, now seen corresponding path program 1 times [2024-11-18 23:52:24,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:24,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687082257] [2024-11-18 23:52:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:24,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:24,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:24,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687082257] [2024-11-18 23:52:24,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687082257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:24,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:24,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 23:52:24,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609082274] [2024-11-18 23:52:24,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:24,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 23:52:24,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:24,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 23:52:24,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 23:52:24,621 INFO L87 Difference]: Start difference. First operand 334 states and 499 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:24,844 INFO L93 Difference]: Finished difference Result 606 states and 903 transitions. [2024-11-18 23:52:24,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 23:52:24,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-11-18 23:52:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:24,847 INFO L225 Difference]: With dead ends: 606 [2024-11-18 23:52:24,847 INFO L226 Difference]: Without dead ends: 323 [2024-11-18 23:52:24,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-18 23:52:24,849 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 95 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:24,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 322 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:52:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-18 23:52:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 309. [2024-11-18 23:52:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 240 states have (on average 1.35) internal successors, (324), 240 states have internal predecessors, (324), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-18 23:52:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 452 transitions. [2024-11-18 23:52:24,874 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 452 transitions. Word has length 112 [2024-11-18 23:52:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:24,874 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 452 transitions. [2024-11-18 23:52:24,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 452 transitions. [2024-11-18 23:52:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-18 23:52:24,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:24,876 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:24,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 23:52:24,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:24,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1780310582, now seen corresponding path program 1 times [2024-11-18 23:52:24,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:24,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772305391] [2024-11-18 23:52:24,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:25,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:25,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772305391] [2024-11-18 23:52:25,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772305391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:25,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:25,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 23:52:25,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557463729] [2024-11-18 23:52:25,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:25,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 23:52:25,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:25,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 23:52:25,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 23:52:25,037 INFO L87 Difference]: Start difference. First operand 309 states and 452 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:25,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:25,192 INFO L93 Difference]: Finished difference Result 636 states and 929 transitions. [2024-11-18 23:52:25,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 23:52:25,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-11-18 23:52:25,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:25,195 INFO L225 Difference]: With dead ends: 636 [2024-11-18 23:52:25,195 INFO L226 Difference]: Without dead ends: 382 [2024-11-18 23:52:25,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 23:52:25,198 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 90 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:25,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 402 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 23:52:25,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-18 23:52:25,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 339. [2024-11-18 23:52:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 270 states have (on average 1.3555555555555556) internal successors, (366), 270 states have internal predecessors, (366), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-18 23:52:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 494 transitions. [2024-11-18 23:52:25,224 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 494 transitions. Word has length 115 [2024-11-18 23:52:25,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:25,225 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 494 transitions. [2024-11-18 23:52:25,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 494 transitions. [2024-11-18 23:52:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-18 23:52:25,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:25,227 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:25,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 23:52:25,228 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:25,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:25,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1104085425, now seen corresponding path program 1 times [2024-11-18 23:52:25,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:25,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468918123] [2024-11-18 23:52:25,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:25,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:26,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:26,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468918123] [2024-11-18 23:52:26,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468918123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:26,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:26,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 23:52:26,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125833492] [2024-11-18 23:52:26,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:26,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 23:52:26,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:26,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 23:52:26,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-18 23:52:26,679 INFO L87 Difference]: Start difference. First operand 339 states and 494 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:28,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:28,057 INFO L93 Difference]: Finished difference Result 757 states and 1100 transitions. [2024-11-18 23:52:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 23:52:28,058 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-18 23:52:28,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:28,062 INFO L225 Difference]: With dead ends: 757 [2024-11-18 23:52:28,062 INFO L226 Difference]: Without dead ends: 503 [2024-11-18 23:52:28,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-18 23:52:28,066 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 53 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:28,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 667 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 23:52:28,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-18 23:52:28,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 423. [2024-11-18 23:52:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 354 states have (on average 1.3672316384180792) internal successors, (484), 354 states have internal predecessors, (484), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-18 23:52:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 612 transitions. [2024-11-18 23:52:28,115 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 612 transitions. Word has length 116 [2024-11-18 23:52:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:28,116 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 612 transitions. [2024-11-18 23:52:28,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 612 transitions. [2024-11-18 23:52:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-18 23:52:28,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:28,117 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:28,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 23:52:28,118 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:28,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2115202675, now seen corresponding path program 1 times [2024-11-18 23:52:28,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:28,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683836543] [2024-11-18 23:52:28,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:28,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:29,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:29,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683836543] [2024-11-18 23:52:29,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683836543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:29,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:29,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 23:52:29,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349029769] [2024-11-18 23:52:29,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:29,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 23:52:29,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:29,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 23:52:29,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-18 23:52:29,481 INFO L87 Difference]: Start difference. First operand 423 states and 612 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:31,739 INFO L93 Difference]: Finished difference Result 888 states and 1279 transitions. [2024-11-18 23:52:31,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 23:52:31,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-18 23:52:31,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:31,744 INFO L225 Difference]: With dead ends: 888 [2024-11-18 23:52:31,744 INFO L226 Difference]: Without dead ends: 571 [2024-11-18 23:52:31,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-18 23:52:31,746 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 53 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:31,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 761 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-18 23:52:31,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-11-18 23:52:31,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 423. [2024-11-18 23:52:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 354 states have (on average 1.3672316384180792) internal successors, (484), 354 states have internal predecessors, (484), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-18 23:52:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 612 transitions. [2024-11-18 23:52:31,780 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 612 transitions. Word has length 116 [2024-11-18 23:52:31,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:31,780 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 612 transitions. [2024-11-18 23:52:31,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:31,781 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 612 transitions. [2024-11-18 23:52:31,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-18 23:52:31,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:31,782 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:31,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 23:52:31,783 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:31,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:31,783 INFO L85 PathProgramCache]: Analyzing trace with hash 450165509, now seen corresponding path program 1 times [2024-11-18 23:52:31,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:31,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019493585] [2024-11-18 23:52:31,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:31,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:32,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:32,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019493585] [2024-11-18 23:52:32,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019493585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:32,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:32,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 23:52:32,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541901547] [2024-11-18 23:52:32,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:32,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 23:52:32,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:32,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 23:52:32,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 23:52:32,022 INFO L87 Difference]: Start difference. First operand 423 states and 612 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:32,345 INFO L93 Difference]: Finished difference Result 886 states and 1270 transitions. [2024-11-18 23:52:32,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 23:52:32,345 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-18 23:52:32,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:32,349 INFO L225 Difference]: With dead ends: 886 [2024-11-18 23:52:32,349 INFO L226 Difference]: Without dead ends: 569 [2024-11-18 23:52:32,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-18 23:52:32,351 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 172 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:32,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 606 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:52:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-18 23:52:32,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 450. [2024-11-18 23:52:32,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 381 states have (on average 1.3648293963254594) internal successors, (520), 381 states have internal predecessors, (520), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-18 23:52:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 648 transitions. [2024-11-18 23:52:32,385 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 648 transitions. Word has length 117 [2024-11-18 23:52:32,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:32,386 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 648 transitions. [2024-11-18 23:52:32,386 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 648 transitions. [2024-11-18 23:52:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-18 23:52:32,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:32,388 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:32,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 23:52:32,389 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:32,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:32,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2035710686, now seen corresponding path program 1 times [2024-11-18 23:52:32,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:32,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296103062] [2024-11-18 23:52:32,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:32,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:32,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:32,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296103062] [2024-11-18 23:52:32,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296103062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:32,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:32,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 23:52:32,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206495430] [2024-11-18 23:52:32,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:32,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 23:52:32,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:32,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 23:52:32,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 23:52:32,591 INFO L87 Difference]: Start difference. First operand 450 states and 648 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:32,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:32,921 INFO L93 Difference]: Finished difference Result 938 states and 1345 transitions. [2024-11-18 23:52:32,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 23:52:32,921 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-18 23:52:32,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:32,927 INFO L225 Difference]: With dead ends: 938 [2024-11-18 23:52:32,928 INFO L226 Difference]: Without dead ends: 621 [2024-11-18 23:52:32,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-18 23:52:32,930 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 174 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:32,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 912 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:52:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-18 23:52:32,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 553. [2024-11-18 23:52:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 466 states have (on average 1.349785407725322) internal successors, (629), 468 states have internal predecessors, (629), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-18 23:52:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 789 transitions. [2024-11-18 23:52:32,968 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 789 transitions. Word has length 117 [2024-11-18 23:52:32,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:32,969 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 789 transitions. [2024-11-18 23:52:32,969 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 789 transitions. [2024-11-18 23:52:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-18 23:52:32,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:32,971 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:32,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 23:52:32,971 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:32,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:32,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1238361545, now seen corresponding path program 1 times [2024-11-18 23:52:32,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:32,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508595214] [2024-11-18 23:52:32,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:32,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:33,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:33,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508595214] [2024-11-18 23:52:33,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508595214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:33,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:33,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:52:33,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114976752] [2024-11-18 23:52:33,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:33,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:52:33,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:33,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:52:33,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:52:33,047 INFO L87 Difference]: Start difference. First operand 553 states and 789 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:33,111 INFO L93 Difference]: Finished difference Result 1194 states and 1698 transitions. [2024-11-18 23:52:33,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:52:33,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-18 23:52:33,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:33,118 INFO L225 Difference]: With dead ends: 1194 [2024-11-18 23:52:33,118 INFO L226 Difference]: Without dead ends: 786 [2024-11-18 23:52:33,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 23:52:33,120 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 51 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:33,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 203 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:52:33,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-18 23:52:33,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 781. [2024-11-18 23:52:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 676 states have (on average 1.3387573964497042) internal successors, (905), 681 states have internal predecessors, (905), 92 states have call successors, (92), 12 states have call predecessors, (92), 12 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-18 23:52:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1089 transitions. [2024-11-18 23:52:33,173 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1089 transitions. Word has length 118 [2024-11-18 23:52:33,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:33,174 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1089 transitions. [2024-11-18 23:52:33,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1089 transitions. [2024-11-18 23:52:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-18 23:52:33,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:33,178 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:33,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 23:52:33,178 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:33,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:33,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1512025676, now seen corresponding path program 1 times [2024-11-18 23:52:33,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:33,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566742327] [2024-11-18 23:52:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:33,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:33,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566742327] [2024-11-18 23:52:33,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566742327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:33,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:33,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 23:52:33,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25353825] [2024-11-18 23:52:33,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:33,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 23:52:33,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:33,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 23:52:33,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 23:52:33,589 INFO L87 Difference]: Start difference. First operand 781 states and 1089 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:33,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:33,841 INFO L93 Difference]: Finished difference Result 916 states and 1266 transitions. [2024-11-18 23:52:33,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 23:52:33,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-18 23:52:33,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:33,847 INFO L225 Difference]: With dead ends: 916 [2024-11-18 23:52:33,849 INFO L226 Difference]: Without dead ends: 914 [2024-11-18 23:52:33,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-18 23:52:33,850 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 65 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:33,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 735 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 23:52:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2024-11-18 23:52:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 910. [2024-11-18 23:52:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 759 states have (on average 1.308300395256917) internal successors, (993), 769 states have internal predecessors, (993), 132 states have call successors, (132), 18 states have call predecessors, (132), 18 states have return successors, (132), 122 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-18 23:52:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1257 transitions. [2024-11-18 23:52:33,930 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1257 transitions. Word has length 118 [2024-11-18 23:52:33,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:33,931 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1257 transitions. [2024-11-18 23:52:33,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:33,931 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1257 transitions. [2024-11-18 23:52:33,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-18 23:52:33,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:33,933 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:33,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 23:52:33,934 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:33,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:33,934 INFO L85 PathProgramCache]: Analyzing trace with hash -734222472, now seen corresponding path program 1 times [2024-11-18 23:52:33,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:33,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049293428] [2024-11-18 23:52:33,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:33,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:34,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:34,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049293428] [2024-11-18 23:52:34,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049293428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:34,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:34,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 23:52:34,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713283115] [2024-11-18 23:52:34,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:34,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 23:52:34,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:34,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 23:52:34,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-18 23:52:34,935 INFO L87 Difference]: Start difference. First operand 910 states and 1257 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:35,731 INFO L93 Difference]: Finished difference Result 2191 states and 3021 transitions. [2024-11-18 23:52:35,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 23:52:35,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-18 23:52:35,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:35,742 INFO L225 Difference]: With dead ends: 2191 [2024-11-18 23:52:35,742 INFO L226 Difference]: Without dead ends: 1498 [2024-11-18 23:52:35,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-18 23:52:35,747 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 64 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:35,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 738 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 23:52:35,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-11-18 23:52:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1218. [2024-11-18 23:52:35,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1039 states have (on average 1.3070259865255054) internal successors, (1358), 1052 states have internal predecessors, (1358), 156 states have call successors, (156), 22 states have call predecessors, (156), 22 states have return successors, (156), 143 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-18 23:52:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1670 transitions. [2024-11-18 23:52:35,905 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1670 transitions. Word has length 118 [2024-11-18 23:52:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:35,905 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1670 transitions. [2024-11-18 23:52:35,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1670 transitions. [2024-11-18 23:52:35,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-18 23:52:35,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:35,908 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:35,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-18 23:52:35,908 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:35,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:35,909 INFO L85 PathProgramCache]: Analyzing trace with hash 545641206, now seen corresponding path program 1 times [2024-11-18 23:52:35,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:35,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53698758] [2024-11-18 23:52:35,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:35,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:36,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:36,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53698758] [2024-11-18 23:52:36,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53698758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:36,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:36,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 23:52:36,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494963817] [2024-11-18 23:52:36,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:36,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 23:52:36,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:36,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 23:52:36,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-18 23:52:36,606 INFO L87 Difference]: Start difference. First operand 1218 states and 1670 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:37,763 INFO L93 Difference]: Finished difference Result 2517 states and 3432 transitions. [2024-11-18 23:52:37,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 23:52:37,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-18 23:52:37,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:37,774 INFO L225 Difference]: With dead ends: 2517 [2024-11-18 23:52:37,774 INFO L226 Difference]: Without dead ends: 1615 [2024-11-18 23:52:37,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-18 23:52:37,779 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 39 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:37,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 721 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 23:52:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2024-11-18 23:52:38,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1602. [2024-11-18 23:52:38,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1388 states have (on average 1.2845821325648414) internal successors, (1783), 1412 states have internal predecessors, (1783), 178 states have call successors, (178), 35 states have call predecessors, (178), 35 states have return successors, (178), 154 states have call predecessors, (178), 178 states have call successors, (178) [2024-11-18 23:52:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2139 transitions. [2024-11-18 23:52:38,082 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2139 transitions. Word has length 118 [2024-11-18 23:52:38,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:38,083 INFO L471 AbstractCegarLoop]: Abstraction has 1602 states and 2139 transitions. [2024-11-18 23:52:38,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:38,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2139 transitions. [2024-11-18 23:52:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-18 23:52:38,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:38,087 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:38,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-18 23:52:38,087 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:38,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:38,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1079010836, now seen corresponding path program 1 times [2024-11-18 23:52:38,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:38,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317870624] [2024-11-18 23:52:38,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:38,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:38,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:38,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317870624] [2024-11-18 23:52:38,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317870624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:38,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:38,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 23:52:38,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143611793] [2024-11-18 23:52:38,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:38,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 23:52:38,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:38,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 23:52:38,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 23:52:38,390 INFO L87 Difference]: Start difference. First operand 1602 states and 2139 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 23:52:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:38,967 INFO L93 Difference]: Finished difference Result 3000 states and 4038 transitions. [2024-11-18 23:52:38,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 23:52:38,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 118 [2024-11-18 23:52:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:38,977 INFO L225 Difference]: With dead ends: 3000 [2024-11-18 23:52:38,977 INFO L226 Difference]: Without dead ends: 1848 [2024-11-18 23:52:38,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-18 23:52:38,980 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 189 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:38,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 447 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:52:38,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2024-11-18 23:52:39,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1828. [2024-11-18 23:52:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1562 states have (on average 1.267605633802817) internal successors, (1980), 1591 states have internal predecessors, (1980), 218 states have call successors, (218), 47 states have call predecessors, (218), 47 states have return successors, (218), 189 states have call predecessors, (218), 218 states have call successors, (218) [2024-11-18 23:52:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2416 transitions. [2024-11-18 23:52:39,252 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2416 transitions. Word has length 118 [2024-11-18 23:52:39,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:39,253 INFO L471 AbstractCegarLoop]: Abstraction has 1828 states and 2416 transitions. [2024-11-18 23:52:39,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 23:52:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2416 transitions. [2024-11-18 23:52:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-18 23:52:39,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:39,256 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:39,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-18 23:52:39,256 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:39,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:39,257 INFO L85 PathProgramCache]: Analyzing trace with hash -654609696, now seen corresponding path program 1 times [2024-11-18 23:52:39,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:39,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462586806] [2024-11-18 23:52:39,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:39,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:39,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:39,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462586806] [2024-11-18 23:52:39,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462586806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:39,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:39,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:52:39,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154747324] [2024-11-18 23:52:39,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:39,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:52:39,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:39,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:52:39,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:52:39,324 INFO L87 Difference]: Start difference. First operand 1828 states and 2416 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:39,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:39,611 INFO L93 Difference]: Finished difference Result 3240 states and 4299 transitions. [2024-11-18 23:52:39,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:52:39,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-18 23:52:39,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:39,622 INFO L225 Difference]: With dead ends: 3240 [2024-11-18 23:52:39,622 INFO L226 Difference]: Without dead ends: 1854 [2024-11-18 23:52:39,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 23:52:39,627 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 50 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:39,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 258 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:52:39,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2024-11-18 23:52:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1385. [2024-11-18 23:52:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1191 states have (on average 1.2636439966414776) internal successors, (1505), 1206 states have internal predecessors, (1505), 158 states have call successors, (158), 35 states have call predecessors, (158), 35 states have return successors, (158), 143 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-18 23:52:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1821 transitions. [2024-11-18 23:52:39,808 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1821 transitions. Word has length 118 [2024-11-18 23:52:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:39,809 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1821 transitions. [2024-11-18 23:52:39,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:39,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1821 transitions. [2024-11-18 23:52:39,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-18 23:52:39,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:39,812 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:39,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-18 23:52:39,813 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:39,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:39,813 INFO L85 PathProgramCache]: Analyzing trace with hash 230659259, now seen corresponding path program 1 times [2024-11-18 23:52:39,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:39,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50633711] [2024-11-18 23:52:39,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:39,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:40,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:40,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50633711] [2024-11-18 23:52:40,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50633711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:40,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:40,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 23:52:40,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809079822] [2024-11-18 23:52:40,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:40,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 23:52:40,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:40,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 23:52:40,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-18 23:52:40,249 INFO L87 Difference]: Start difference. First operand 1385 states and 1821 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:40,768 INFO L93 Difference]: Finished difference Result 2772 states and 3652 transitions. [2024-11-18 23:52:40,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 23:52:40,768 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-18 23:52:40,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:40,776 INFO L225 Difference]: With dead ends: 2772 [2024-11-18 23:52:40,777 INFO L226 Difference]: Without dead ends: 1634 [2024-11-18 23:52:40,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-18 23:52:40,779 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 136 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:40,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 751 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:52:40,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-18 23:52:40,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1385. [2024-11-18 23:52:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1191 states have (on average 1.260285474391268) internal successors, (1501), 1206 states have internal predecessors, (1501), 158 states have call successors, (158), 35 states have call predecessors, (158), 35 states have return successors, (158), 143 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-18 23:52:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1817 transitions. [2024-11-18 23:52:40,943 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1817 transitions. Word has length 119 [2024-11-18 23:52:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:40,944 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1817 transitions. [2024-11-18 23:52:40,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1817 transitions. [2024-11-18 23:52:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-18 23:52:40,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:40,946 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:40,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-18 23:52:40,946 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:40,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:40,947 INFO L85 PathProgramCache]: Analyzing trace with hash -327146750, now seen corresponding path program 1 times [2024-11-18 23:52:40,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:40,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731522830] [2024-11-18 23:52:40,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:40,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:41,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:41,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731522830] [2024-11-18 23:52:41,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731522830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:41,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:41,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-18 23:52:41,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183205978] [2024-11-18 23:52:41,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:41,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 23:52:41,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:41,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 23:52:41,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-18 23:52:41,555 INFO L87 Difference]: Start difference. First operand 1385 states and 1817 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:42,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:42,454 INFO L93 Difference]: Finished difference Result 2715 states and 3584 transitions. [2024-11-18 23:52:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 23:52:42,455 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-18 23:52:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:42,463 INFO L225 Difference]: With dead ends: 2715 [2024-11-18 23:52:42,464 INFO L226 Difference]: Without dead ends: 1635 [2024-11-18 23:52:42,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-11-18 23:52:42,467 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 178 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:42,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 748 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 23:52:42,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-11-18 23:52:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1391. [2024-11-18 23:52:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1197 states have (on average 1.2589807852965749) internal successors, (1507), 1212 states have internal predecessors, (1507), 158 states have call successors, (158), 35 states have call predecessors, (158), 35 states have return successors, (158), 143 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-18 23:52:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1823 transitions. [2024-11-18 23:52:42,642 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1823 transitions. Word has length 119 [2024-11-18 23:52:42,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:42,642 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1823 transitions. [2024-11-18 23:52:42,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1823 transitions. [2024-11-18 23:52:42,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-18 23:52:42,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:42,644 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:42,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-18 23:52:42,645 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:42,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:42,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1350068558, now seen corresponding path program 1 times [2024-11-18 23:52:42,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:42,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403379470] [2024-11-18 23:52:42,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:42,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-11-18 23:52:42,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:52:42,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403379470] [2024-11-18 23:52:42,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403379470] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:52:42,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387160703] [2024-11-18 23:52:42,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:42,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:52:42,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:52:42,868 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-18 23:52:42,869 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-18 23:52:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:42,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 23:52:42,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:52:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 194 proven. 9 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-11-18 23:52:43,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:52:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 12 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-11-18 23:52:43,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387160703] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:52:43,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 23:52:43,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2024-11-18 23:52:43,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623023574] [2024-11-18 23:52:43,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 23:52:43,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 23:52:43,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:52:43,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 23:52:43,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-18 23:52:43,309 INFO L87 Difference]: Start difference. First operand 1391 states and 1823 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-18 23:52:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:43,740 INFO L93 Difference]: Finished difference Result 2835 states and 3676 transitions. [2024-11-18 23:52:43,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 23:52:43,741 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 119 [2024-11-18 23:52:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:43,749 INFO L225 Difference]: With dead ends: 2835 [2024-11-18 23:52:43,749 INFO L226 Difference]: Without dead ends: 1489 [2024-11-18 23:52:43,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2024-11-18 23:52:43,755 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 221 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:43,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 250 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:52:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2024-11-18 23:52:43,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1423. [2024-11-18 23:52:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 1221 states have (on average 1.2391482391482391) internal successors, (1513), 1236 states have internal predecessors, (1513), 158 states have call successors, (158), 43 states have call predecessors, (158), 43 states have return successors, (158), 143 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-18 23:52:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1829 transitions. [2024-11-18 23:52:43,958 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1829 transitions. Word has length 119 [2024-11-18 23:52:43,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:43,959 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 1829 transitions. [2024-11-18 23:52:43,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-18 23:52:43,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1829 transitions. [2024-11-18 23:52:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-18 23:52:43,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:43,961 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:43,978 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-18 23:52:44,165 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,SelfDestructingSolverStorable19 [2024-11-18 23:52:44,166 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:44,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:44,168 INFO L85 PathProgramCache]: Analyzing trace with hash 437433562, now seen corresponding path program 1 times [2024-11-18 23:52:44,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:52:44,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764173356] [2024-11-18 23:52:44,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:44,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:52:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 23:52:44,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [194543336] [2024-11-18 23:52:44,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:44,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:52:44,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:52:44,220 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-18 23:52:44,221 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-18 23:52:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:52:44,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 23:52:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:52:44,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 23:52:44,452 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 23:52:44,454 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 23:52:44,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 23:52:44,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:52:44,661 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:52:44,764 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 23:52:44,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:52:44 BoogieIcfgContainer [2024-11-18 23:52:44,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 23:52:44,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 23:52:44,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 23:52:44,768 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 23:52:44,769 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:52:20" (3/4) ... [2024-11-18 23:52:44,771 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 23:52:44,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 23:52:44,774 INFO L158 Benchmark]: Toolchain (without parser) took 25151.07ms. Allocated memory was 172.0MB in the beginning and 541.1MB in the end (delta: 369.1MB). Free memory was 144.1MB in the beginning and 412.1MB in the end (delta: -268.1MB). Peak memory consumption was 100.8MB. Max. memory is 16.1GB. [2024-11-18 23:52:44,774 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 172.0MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:52:44,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.67ms. Allocated memory is still 172.0MB. Free memory was 144.1MB in the beginning and 129.3MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 23:52:44,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.12ms. Allocated memory is still 172.0MB. Free memory was 129.3MB in the beginning and 125.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 23:52:44,777 INFO L158 Benchmark]: Boogie Preprocessor took 76.20ms. Allocated memory is still 172.0MB. Free memory was 125.2MB in the beginning and 121.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 23:52:44,778 INFO L158 Benchmark]: RCFGBuilder took 683.00ms. Allocated memory is still 172.0MB. Free memory was 120.2MB in the beginning and 122.1MB in the end (delta: -1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 23:52:44,778 INFO L158 Benchmark]: TraceAbstraction took 23956.76ms. Allocated memory was 172.0MB in the beginning and 541.1MB in the end (delta: 369.1MB). Free memory was 121.3MB in the beginning and 413.2MB in the end (delta: -291.9MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2024-11-18 23:52:44,778 INFO L158 Benchmark]: Witness Printer took 4.65ms. Allocated memory is still 541.1MB. Free memory was 413.2MB in the beginning and 412.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:52:44,779 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.19ms. Allocated memory is still 172.0MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.67ms. Allocated memory is still 172.0MB. Free memory was 144.1MB in the beginning and 129.3MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.12ms. Allocated memory is still 172.0MB. Free memory was 129.3MB in the beginning and 125.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.20ms. Allocated memory is still 172.0MB. Free memory was 125.2MB in the beginning and 121.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 683.00ms. Allocated memory is still 172.0MB. Free memory was 120.2MB in the beginning and 122.1MB in the end (delta: -1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23956.76ms. Allocated memory was 172.0MB in the beginning and 541.1MB in the end (delta: 369.1MB). Free memory was 121.3MB in the beginning and 413.2MB in the end (delta: -291.9MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. * Witness Printer took 4.65ms. Allocated memory is still 541.1MB. Free memory was 413.2MB in the beginning and 412.1MB in the end (delta: 1.0MB). 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 shiftLeft at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_3 = 128; [L24] unsigned short int var_1_4 = 4; [L25] unsigned short int var_1_5 = 0; [L26] signed short int var_1_6 = 0; [L27] unsigned char var_1_7 = 1; [L28] signed short int var_1_8 = -2; [L29] signed short int var_1_9 = 500; [L30] unsigned long int var_1_10 = 10; [L31] unsigned char var_1_11 = 2; [L32] unsigned char var_1_12 = 64; [L33] unsigned long int var_1_13 = 1; [L34] unsigned long int last_1_var_1_10 = 10; [L35] unsigned long int last_1_var_1_13 = 1; VAL [isInitial=0, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L86] last_1_var_1_10 = var_1_10 [L87] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L97] RET updateLastVariables() [L98] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L63] var_1_4 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L64] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L66] var_1_5 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L69] var_1_7 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L70] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L71] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L71] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L73] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L74] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L74] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L76] RET assume_abort_if_not(var_1_9 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L79] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L80] CALL assume_abort_if_not(var_1_11 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L80] RET assume_abort_if_not(var_1_11 <= 128) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L82] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L83] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L83] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L98] RET updateVariables() [L99] CALL step() [L39] COND FALSE !(last_1_var_1_13 >= -50) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L42] EXPR var_1_11 & var_1_12 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L42] signed long int stepLocal_0 = var_1_11 & var_1_12; [L43] COND TRUE \read(var_1_7) [L44] var_1_13 = ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L50] COND TRUE \read(var_1_7) [L51] var_1_6 = (var_1_8 + var_1_9) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L53] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L53] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L53] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L53] COND FALSE !((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) [L56] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L90] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L90] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L90] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L90] EXPR ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L90-L91] return ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.8s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2146 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2133 mSDsluCounter, 9903 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7491 mSDsCounter, 458 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2832 IncrementalHoareTripleChecker+Invalid, 3290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 458 mSolverCounterUnsat, 2412 mSDtfsCounter, 2832 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 545 GetRequests, 396 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1828occurred in iteration=16, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 1974 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 2779 NumberOfCodeBlocks, 2779 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2635 ConstructedInterpolants, 0 QuantifiedInterpolants, 10823 SizeOfPredicates, 1 NumberOfNonLiveVariables, 528 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 23 InterpolantComputations, 19 PerfectInterpolantSequences, 10980/11040 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-18 23:52:44,858 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_amount25_file-32.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 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:52:47,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:52:47,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 23:52:47,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:52:47,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:52:47,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:52:47,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:52:47,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:52:47,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:52:47,355 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:52:47,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:52:47,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:52:47,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:52:47,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:52:47,357 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:52:47,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:52:47,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:52:47,358 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:52:47,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:52:47,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:52:47,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:52:47,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:52:47,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:52:47,363 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 23:52:47,363 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 23:52:47,363 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:52:47,364 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 23:52:47,364 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:52:47,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:52:47,364 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:52:47,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:52:47,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:52:47,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:52:47,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:52:47,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:52:47,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:52:47,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:52:47,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:52:47,370 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 23:52:47,370 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 23:52:47,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:52:47,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:52:47,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:52:47,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:52:47,372 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 -> 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 [2024-11-18 23:52:47,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:52:47,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:52:47,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:52:47,754 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:52:47,755 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:52:47,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2024-11-18 23:52:49,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:52:49,680 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:52:49,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2024-11-18 23:52:49,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f35fa8658/b1d05a3a3bb34f909c8077531f115469/FLAGc0d212476 [2024-11-18 23:52:49,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f35fa8658/b1d05a3a3bb34f909c8077531f115469 [2024-11-18 23:52:49,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:52:49,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:52:49,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:52:49,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:52:49,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:52:49,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:52:49" (1/1) ... [2024-11-18 23:52:49,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@457f4646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:49, skipping insertion in model container [2024-11-18 23:52:49,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:52:49" (1/1) ... [2024-11-18 23:52:49,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:52:49,962 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_amount25_file-32.i[915,928] [2024-11-18 23:52:50,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:52:50,049 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:52:50,065 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_amount25_file-32.i[915,928] [2024-11-18 23:52:50,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:52:50,117 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:52:50,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:50 WrapperNode [2024-11-18 23:52:50,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:52:50,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:52:50,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:52:50,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:52:50,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:50" (1/1) ... [2024-11-18 23:52:50,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:50" (1/1) ... [2024-11-18 23:52:50,171 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-18 23:52:50,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:52:50,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:52:50,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:52:50,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:52:50,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:50" (1/1) ... [2024-11-18 23:52:50,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:50" (1/1) ... [2024-11-18 23:52:50,192 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:50" (1/1) ... [2024-11-18 23:52:50,206 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-18 23:52:50,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:50" (1/1) ... [2024-11-18 23:52:50,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:50" (1/1) ... [2024-11-18 23:52:50,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:50" (1/1) ... [2024-11-18 23:52:50,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:50" (1/1) ... [2024-11-18 23:52:50,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:50" (1/1) ... [2024-11-18 23:52:50,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:50" (1/1) ... [2024-11-18 23:52:50,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:52:50,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:52:50,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:52:50,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:52:50,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:50" (1/1) ... [2024-11-18 23:52:50,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:52:50,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:52:50,280 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-18 23:52:50,287 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-18 23:52:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:52:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 23:52:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:52:50,339 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:52:50,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:52:50,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:52:50,429 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:52:50,433 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:52:50,758 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-18 23:52:50,759 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:52:50,772 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:52:50,772 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:52:50,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:52:50 BoogieIcfgContainer [2024-11-18 23:52:50,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:52:50,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:52:50,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:52:50,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:52:50,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:52:49" (1/3) ... [2024-11-18 23:52:50,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f363e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:52:50, skipping insertion in model container [2024-11-18 23:52:50,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:50" (2/3) ... [2024-11-18 23:52:50,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f363e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:52:50, skipping insertion in model container [2024-11-18 23:52:50,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:52:50" (3/3) ... [2024-11-18 23:52:50,781 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-32.i [2024-11-18 23:52:50,797 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:52:50,798 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:52:50,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:52:50,876 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;@7ef60e42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:52:50,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:52:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 23:52:50,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-18 23:52:50,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:50,893 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:50,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:50,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:50,901 INFO L85 PathProgramCache]: Analyzing trace with hash -825664696, now seen corresponding path program 1 times [2024-11-18 23:52:50,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:52:50,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53086515] [2024-11-18 23:52:50,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:50,919 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-18 23:52:50,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:52:50,922 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-18 23:52:50,924 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-18 23:52:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:51,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 23:52:51,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:52:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 23:52:51,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:52:51,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:52:51,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53086515] [2024-11-18 23:52:51,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53086515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:52:51,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:52:51,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:52:51,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154115660] [2024-11-18 23:52:51,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:52:51,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 23:52:51,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:52:51,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 23:52:51,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 23:52:51,593 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:52:51,806 INFO L93 Difference]: Finished difference Result 142 states and 250 transitions. [2024-11-18 23:52:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 23:52:51,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2024-11-18 23:52:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:52:51,819 INFO L225 Difference]: With dead ends: 142 [2024-11-18 23:52:51,819 INFO L226 Difference]: Without dead ends: 96 [2024-11-18 23:52:51,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 23:52:51,830 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 45 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 23:52:51,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 187 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 23:52:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-18 23:52:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2024-11-18 23:52:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-18 23:52:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2024-11-18 23:52:51,894 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 102 [2024-11-18 23:52:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:52:51,895 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2024-11-18 23:52:51,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 23:52:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2024-11-18 23:52:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-18 23:52:51,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:52:51,900 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:52:51,910 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-18 23:52:52,100 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-18 23:52:52,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:52:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:52:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash -145606326, now seen corresponding path program 1 times [2024-11-18 23:52:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:52:52,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857778427] [2024-11-18 23:52:52,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:52:52,103 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-18 23:52:52,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:52:52,105 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-18 23:52:52,106 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-18 23:52:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:52:52,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-18 23:52:52,233 INFO L278 TraceCheckSpWp]: Computing forward predicates...