./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_fillercode_fillercodesize_normal_file-98.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 2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:43:50,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:43:50,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:43:50,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:43:50,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:43:50,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:43:50,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:43:50,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:43:50,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:43:50,407 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:43:50,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:43:50,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:43:50,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:43:50,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:43:50,411 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:43:50,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:43:50,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:43:50,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:43:50,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:43:50,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:43:50,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:43:50,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:43:50,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:43:50,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:43:50,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:43:50,418 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:43:50,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:43:50,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:43:50,419 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:43:50,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:43:50,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:43:50,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:43:50,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:43:50,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:43:50,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:43:50,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:43:50,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:43:50,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:43:50,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:43:50,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:43:50,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:43:50,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:43:50,424 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 -> 2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c [2024-11-12 01:43:50,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:43:50,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:43:50,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:43:50,715 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:43:50,715 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:43:50,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-98.i [2024-11-12 01:43:52,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:43:52,362 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:43:52,364 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-98.i [2024-11-12 01:43:52,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59712aa30/600c9ab08a28484bb35eefb7afe320e5/FLAG5bd5a9d62 [2024-11-12 01:43:52,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59712aa30/600c9ab08a28484bb35eefb7afe320e5 [2024-11-12 01:43:52,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:43:52,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:43:52,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:43:52,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:43:52,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:43:52,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:43:52" (1/1) ... [2024-11-12 01:43:52,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6895aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:52, skipping insertion in model container [2024-11-12 01:43:52,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:43:52" (1/1) ... [2024-11-12 01:43:52,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:43:52,656 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_fillercode_fillercodesize_normal_file-98.i[913,926] [2024-11-12 01:43:52,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:43:52,725 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:43:52,737 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_fillercode_fillercodesize_normal_file-98.i[913,926] [2024-11-12 01:43:52,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:43:52,801 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:43:52,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:52 WrapperNode [2024-11-12 01:43:52,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:43:52,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:43:52,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:43:52,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:43:52,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:52" (1/1) ... [2024-11-12 01:43:52,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:52" (1/1) ... [2024-11-12 01:43:52,865 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-11-12 01:43:52,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:43:52,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:43:52,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:43:52,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:43:52,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:52" (1/1) ... [2024-11-12 01:43:52,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:52" (1/1) ... [2024-11-12 01:43:52,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:52" (1/1) ... [2024-11-12 01:43:52,912 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-12 01:43:52,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:52" (1/1) ... [2024-11-12 01:43:52,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:52" (1/1) ... [2024-11-12 01:43:52,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:52" (1/1) ... [2024-11-12 01:43:52,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:52" (1/1) ... [2024-11-12 01:43:52,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:52" (1/1) ... [2024-11-12 01:43:52,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:52" (1/1) ... [2024-11-12 01:43:52,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:43:52,944 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:43:52,944 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:43:52,944 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:43:52,945 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:52" (1/1) ... [2024-11-12 01:43:52,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:43:52,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:43:52,989 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-12 01:43:52,995 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-12 01:43:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:43:53,037 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:43:53,037 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:43:53,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:43:53,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:43:53,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:43:53,121 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:43:53,123 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:43:53,562 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 01:43:53,562 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:43:53,574 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:43:53,578 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:43:53,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:43:53 BoogieIcfgContainer [2024-11-12 01:43:53,579 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:43:53,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:43:53,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:43:53,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:43:53,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:43:52" (1/3) ... [2024-11-12 01:43:53,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21df04d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:43:53, skipping insertion in model container [2024-11-12 01:43:53,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:52" (2/3) ... [2024-11-12 01:43:53,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21df04d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:43:53, skipping insertion in model container [2024-11-12 01:43:53,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:43:53" (3/3) ... [2024-11-12 01:43:53,588 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-98.i [2024-11-12 01:43:53,613 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:43:53,613 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:43:53,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:43:53,695 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;@8e89762, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:43:53,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:43:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 01:43:53,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 01:43:53,709 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:43:53,710 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:43:53,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:43:53,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:43:53,715 INFO L85 PathProgramCache]: Analyzing trace with hash -784140647, now seen corresponding path program 1 times [2024-11-12 01:43:53,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:43:53,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886487602] [2024-11-12 01:43:53,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:43:53,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:43:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:43:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:43:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:43:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:43:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:43:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 01:43:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:43:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:43:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:43:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:43:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:43:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:43:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:43:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:43:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:43:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:43:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:43:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:43:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:43:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:43:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:43:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:43:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:43:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:43:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 01:43:55,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:43:55,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886487602] [2024-11-12 01:43:55,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886487602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:43:55,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:43:55,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:43:55,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571808923] [2024-11-12 01:43:55,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:43:55,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:43:55,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:43:55,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:43:55,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:43:55,525 INFO L87 Difference]: Start difference. First operand has 74 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 01:43:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:43:55,643 INFO L93 Difference]: Finished difference Result 185 states and 339 transitions. [2024-11-12 01:43:55,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:43:55,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-11-12 01:43:55,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:43:55,659 INFO L225 Difference]: With dead ends: 185 [2024-11-12 01:43:55,659 INFO L226 Difference]: Without dead ends: 114 [2024-11-12 01:43:55,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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-12 01:43:55,670 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 98 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 01:43:55,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 222 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 01:43:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-12 01:43:55,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 70. [2024-11-12 01:43:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 01:43:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2024-11-12 01:43:55,729 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 153 [2024-11-12 01:43:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:43:55,731 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions. [2024-11-12 01:43:55,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 01:43:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2024-11-12 01:43:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 01:43:55,734 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:43:55,735 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:43:55,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:43:55,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:43:55,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:43:55,736 INFO L85 PathProgramCache]: Analyzing trace with hash -525975209, now seen corresponding path program 1 times [2024-11-12 01:43:55,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:43:55,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542295035] [2024-11-12 01:43:55,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:43:55,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:43:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:44:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:44:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 01:44:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:44:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:44:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:44:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 01:44:00,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:00,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542295035] [2024-11-12 01:44:00,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542295035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:00,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:00,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:44:00,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371900539] [2024-11-12 01:44:00,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:00,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:44:00,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:00,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:44:00,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:44:00,718 INFO L87 Difference]: Start difference. First operand 70 states and 105 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 01:44:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:01,309 INFO L93 Difference]: Finished difference Result 249 states and 374 transitions. [2024-11-12 01:44:01,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:44:01,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-11-12 01:44:01,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:01,317 INFO L225 Difference]: With dead ends: 249 [2024-11-12 01:44:01,318 INFO L226 Difference]: Without dead ends: 182 [2024-11-12 01:44:01,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:44:01,320 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 266 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:01,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 262 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 01:44:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-12 01:44:01,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 176. [2024-11-12 01:44:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 107 states have internal predecessors, (135), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-12 01:44:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 267 transitions. [2024-11-12 01:44:01,369 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 267 transitions. Word has length 153 [2024-11-12 01:44:01,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:01,369 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 267 transitions. [2024-11-12 01:44:01,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 01:44:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 267 transitions. [2024-11-12 01:44:01,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 01:44:01,372 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:01,372 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:44:01,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:44:01,373 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:01,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:01,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1249032153, now seen corresponding path program 1 times [2024-11-12 01:44:01,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:01,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063946492] [2024-11-12 01:44:01,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:01,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:44:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:44:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 01:44:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:44:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:44:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:44:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 01:44:52,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:52,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063946492] [2024-11-12 01:44:52,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063946492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:52,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:52,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 01:44:52,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943295629] [2024-11-12 01:44:52,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:52,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 01:44:52,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:52,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 01:44:52,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-12 01:44:52,981 INFO L87 Difference]: Start difference. First operand 176 states and 267 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 01:44:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:53,927 INFO L93 Difference]: Finished difference Result 378 states and 570 transitions. [2024-11-12 01:44:53,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 01:44:53,928 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-11-12 01:44:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:53,932 INFO L225 Difference]: With dead ends: 378 [2024-11-12 01:44:53,933 INFO L226 Difference]: Without dead ends: 205 [2024-11-12 01:44:53,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-11-12 01:44:53,935 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 52 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:53,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 480 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 01:44:53,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-12 01:44:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 198. [2024-11-12 01:44:53,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 128 states have (on average 1.28125) internal successors, (164), 129 states have internal predecessors, (164), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-12 01:44:53,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 296 transitions. [2024-11-12 01:44:53,979 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 296 transitions. Word has length 153 [2024-11-12 01:44:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:53,980 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 296 transitions. [2024-11-12 01:44:53,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 01:44:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 296 transitions. [2024-11-12 01:44:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 01:44:53,983 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:53,983 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:44:53,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 01:44:53,983 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:53,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:53,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1745962159, now seen corresponding path program 1 times [2024-11-12 01:44:53,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:53,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953699136] [2024-11-12 01:44:53,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:53,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:44:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:44:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 01:44:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:44:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:44:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:44:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 01:44:57,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:57,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953699136] [2024-11-12 01:44:57,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953699136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:57,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:57,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 01:44:57,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513058165] [2024-11-12 01:44:57,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:57,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 01:44:57,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:57,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 01:44:57,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 01:44:57,405 INFO L87 Difference]: Start difference. First operand 198 states and 296 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 01:44:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:59,117 INFO L93 Difference]: Finished difference Result 612 states and 924 transitions. [2024-11-12 01:44:59,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 01:44:59,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2024-11-12 01:44:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:59,122 INFO L225 Difference]: With dead ends: 612 [2024-11-12 01:44:59,123 INFO L226 Difference]: Without dead ends: 417 [2024-11-12 01:44:59,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-12 01:44:59,125 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 303 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:59,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 719 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 01:44:59,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-12 01:44:59,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 366. [2024-11-12 01:44:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 227 states have (on average 1.277533039647577) internal successors, (290), 229 states have internal predecessors, (290), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-12 01:44:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 554 transitions. [2024-11-12 01:44:59,205 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 554 transitions. Word has length 153 [2024-11-12 01:44:59,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:59,207 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 554 transitions. [2024-11-12 01:44:59,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 01:44:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 554 transitions. [2024-11-12 01:44:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 01:44:59,210 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:59,211 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:44:59,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 01:44:59,211 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:59,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:59,212 INFO L85 PathProgramCache]: Analyzing trace with hash 29045203, now seen corresponding path program 1 times [2024-11-12 01:44:59,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:59,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321536322] [2024-11-12 01:44:59,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:59,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat